In this paper, we propose a novel approach to image steganography in which embedding is done without making explicit modifications to the image; that is, the embedding distortion introduced to the cover image is both perceptually and statistically ensured to be less detectable. If an image is divided into blocks and each block is hashed, then the hash values could represent the embedded message content. A set of replacement blocks can be obtained by consecutively capturing images of the same scene (or resampling the incident light). Since image content remains the same and noise is sampled, the set of replacements are statistically compatible while still providing unique hash values. With such an approach, the embedder can choose the block with hash value corresponding to the message content without violating any of the natural image statistics. When applied to JPEG images, experiments show that this technique can achieve embedding rates of 0.063 bits per DCT coefficient or 0.157 bits per nonzero DCT coefficient while still remaining undetectable by Farid's universal steganalysis tool.
[1]
Andreas Westfeld,et al.
F5-A Steganographic Algorithm
,
2001,
Information Hiding.
[2]
Nasir D. Memon,et al.
Benchmarking steganographic and steganalysis techniques
,
2005,
IS&T/SPIE Electronic Imaging.
[3]
Niels Provos,et al.
Defending Against Statistical Steganalysis
,
2001,
USENIX Security Symposium.
[4]
Husrev T. Sencar,et al.
Image Steganography: Concepts and Practice
,
2004
.
[5]
Phil Sallee,et al.
Model-Based Steganography
,
2003,
IWDW.
[6]
Andreas Westfeld,et al.
F5—A Steganographic Algorithm High Capacity Despite Better Steganalysis
,
2001
.
[7]
Jessica J. Fridrich,et al.
Perturbed quantization steganography with wet paper codes
,
2004,
MM&Sec '04.
[8]
Gustavus J. Simmons,et al.
The Prisoners' Problem and the Subliminal Channel
,
1983,
CRYPTO.
[9]
Siwei Lyu,et al.
Detecting Hidden Messages Using Higher-Order Statistics and Support Vector Machines
,
2002,
Information Hiding.