22 June 2004 Steganalysis of block-structured stegotext
Author Affiliations +
Abstract
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them, which in turn defines the detectability of the stegosystem. We consider the case of Gaussian random covertexts and mean-squared embedding constraint. We derive a lower bound on the relative entropy between covertext and stegotext for block-based embedding functions. This lower bound can be approached arbitrarily closely using a spread-spectrum method and secret keys with large entropy. The lower bound can also be attained using a stochastic quantization index modulation (QIM) encoder, without need for secret keys. In general, perfect undetectability can be achieved for blockwise memoryless Gaussian covertexts. For general Gaussian covertexts with memory, the relative entropy increases approximately linearly with the number of blocks observed by the steganalyzer. The error probabilities of the best steganalysis methods decrease exponentially with the number of blocks.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ying Wang, Ying Wang, Pierre Moulin, Pierre Moulin, "Steganalysis of block-structured stegotext", Proc. SPIE 5306, Security, Steganography, and Watermarking of Multimedia Contents VI, (22 June 2004); doi: 10.1117/12.527745; https://doi.org/10.1117/12.527745
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Data hiding in binary text documents
Proceedings of SPIE (July 31 2001)
Applied public-key steganography
Proceedings of SPIE (April 28 2002)
Limited distortion in LSB steganography
Proceedings of SPIE (February 15 2006)
ML detection of steganography
Proceedings of SPIE (March 20 2005)

Back to Top