Abstract
We consider here the class of probability mass-function (PMF) based detectors of least significant bit (LSB) embedded steganography. That is, in this paper we investigate the use of frequency counts of pixel intensities as a statistic for tests detecting the presence of hidden messages. We focus on LSB replacement (though we briefly consider LSB matching) embedding as it is a simple technique where the effect on the true PMF of the resulting image can be understood mathematically. We begin our study by considering the existing tests of Westfeld and Pfitzmann [11] and Dabeer et al.[1]. These tests assume that pixel intensities are random values that are independent and identically distributed (i.i.d.). We generalize these tests by considering PMFs of neighboring pixel intensities. We argue that consideration of higher order of correlations provide only diminishing marginal returns, and thus we can make general statements on the value of PMF based detectors. We measure the performance of our tests by calculation of receiver operating curves (ROC) over a corpus of 350 digital images. We then proceed to compare to a non-PMF based test, in particular the RS tests of Fridrich et al [3]. Although our generalized tests outperform existing PMF based predecessors, they are outperformed by the RS tests. This indicates that using PMFs as a statistic for detecting hidden messages is inherently insufficient.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dabeer, O., Sullivan, K., Madhow, U., Chandrasekaran, S., Manjunath, B.S.: Detection of hiding in the least significant bit. IEEE Trans. on Signal Processing 52, 3046–3058 (2004)
UCSB Vision Group; Sullivan et al, Collection of 2977 digital camera images (2004)
Fridrich, J., Goljan, M.: Practical steganalysis of digital images - state of the art. In: Proceedings of SPIE, vol. 4675 (2002)
Fridrich, J., Goljan, M.: On estimation of secret message length in LSB steganography in spatial domain. In: SPIE (2004)
Hoeffding, W.: Asymptotically optimal tests for multinomial distributions. Ann. Math. Statist. 36, 369–408 (1965)
Ker, A.D.: A general framework for structural steganalysis of LSB replacement. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 296–311. Springer, Heidelberg (2005)
Ker, A.: Steganalysis of LSB matching in grayscale images. IEEE Signal Processing Letters 12(6) (June 2005)
Provos, N., Honeyman, P.: Hide and seek: An introduction to stegangography. IEEE Security & Privacy Magazine (May 2003)
Wainwright, M.J., Simoncelli, E.P., Willsky, A.S.: Random cascades on wavelet trees and their use in analyzing and modeling natural images. Applied Computational and Harmonic Analysis 11, 89–123 (2001)
Westfeld, A.: Detecting low embedding rates. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, pp. 324–339. Springer, Heidelberg (2003)
Westfeld, A., Pfitzmann, A.: Attacks on steganographic systems. In: IHW 1999 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Draper, S. et al. (2005). An Analysis of Empirical PMF Based Tests for Least Significant Bit Image Steganography. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds) Information Hiding. IH 2005. Lecture Notes in Computer Science, vol 3727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558859_24
Download citation
DOI: https://doi.org/10.1007/11558859_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29039-1
Online ISBN: 978-3-540-31481-3
eBook Packages: Computer ScienceComputer Science (R0)