Stretching the Limits of Steganography
Proceedings of the First International Workshop on Information Hiding
Attacks on Steganographic Systems
IH '99 Proceedings of the Third International Workshop on Information Hiding
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Steganography Preserving Statistical Properties
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Defending against statistical steganalysis
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
IH'04 Proceedings of the 6th international conference on Information Hiding
Exploiting preserved statistics for steganalysis
IH'04 Proceedings of the 6th international conference on Information Hiding
Statistically undetectable jpeg steganography: dead ends challenges, and opportunities
Proceedings of the 9th workshop on Multimedia & security
On completeness of feature spaces in blind steganalysis
Proceedings of the 10th ACM workshop on Multimedia and security
Novelty detection in blind steganalysis
Proceedings of the 10th ACM workshop on Multimedia and security
Benchmarking for Steganography
Information Hiding
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Proceedings of the 11th ACM workshop on Multimedia and security
Novel stream mining for audio steganalysis
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Improved detection and evaluation for JPEG steganalysis
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Temporal derivative-based spectrum and mel-cepstrum audio steganalysis
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security
An improved approach to steganalysis of JPEG images
Information Sciences: an International Journal
YASS: yet another steganographic scheme that resists blind steganalysis
IH'07 Proceedings of the 9th international conference on Information hiding
A novel universal steganalyser design: "LogSv"
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Steganalysis by subtractive pixel adjacency matrix
IEEE Transactions on Information Forensics and Security
SVD-based universal spatial domain image steganalysis
IEEE Transactions on Information Forensics and Security
Steganography using Gibbs random fields
Proceedings of the 12th ACM workshop on Multimedia and security
Neighboring joint density-based JPEG steganalysis
ACM Transactions on Intelligent Systems and Technology (TIST)
Gibbs construction in steganography
IEEE Transactions on Information Forensics and Security
Hamiltonian graph approach to steganography
International Journal of Electronic Security and Digital Forensics
Ternary data hiding technique for JPEG steganography
IWDW'10 Proceedings of the 9th international conference on Digital watermarking
Derivative-based audio steganalysis
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Steganalysis of DCT-embedding based adaptive steganography and YASS
Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security
A JPEG-based statistically invisible steganography
Proceedings of the Third International Conference on Internet Multimedia Computing and Service
Batch steganography in the real world
Proceedings of the on Multimedia and security
Benchmarking for steganography by kernel fisher discriminant criterion
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Hiding Message in Map Along Pre-Hamiltonian Path
International Journal of Information Security and Privacy
| Hi-index | 0.00 |
We suggest a graph-theoretic approach to steganography based on the idea of exchanging rather than overwriting pixels. We construct a graph from the cover data and the secret message. Pixels that need to be modified are represented as vertices and possible partners of an exchange are connected by edges. An embedding is constructed by solving the combinatorial problem of calculating a maximum cardinality matching. The secret message is then embedded by exchanging those samples given by the matched edges. This embedding preserves first-order statistics. Additionally, the visual changes can be minimized by introducing edge weights. We have implemented an algorithm based on this approach with support for several types of image and audio files and we have conducted computational studies to evaluate the performance of the algorithm.