Higher-order statistical steganalysis of random LSB steganography

This paper presents a new scheme for steganalysis of random LSB embedding, capable of applying to any kind of digital signal in both spatial and transform domains. The proposed scheme is based on defining a space whose elements relate to higher-order statistical properties of the signal and looking for special subsets, which we call Closure of Sets (CoS) in this space. We use this scheme for steganalysis of the LSB steganography in grayscale images, employing a vector of five accurate and monotone features. Experimental results show significantly higher accuracy of the proposed scheme, as compared to those reported in the literature, especially in low embedding rates applications.

[1]  Niels Provos,et al.  Hide and Seek: An Introduction to Steganography , 2003, IEEE Secur. Priv..

[2]  Tuomas Aura,et al.  Practical Invisibility in Digital Communication , 1996, Information Hiding.

[3]  William A. Pearlman,et al.  Steganalysis of additive-noise modelable information hiding , 2003, IS&T/SPIE Electronic Imaging.

[4]  Jessica J. Fridrich,et al.  Detecting LSB Steganography in Color and Gray-Scale Images , 2001, IEEE Multim..

[5]  Nasir D. Memon,et al.  On steganalysis of random LSB embedding in continuous-tone images , 2002, Proceedings. International Conference on Image Processing.

[6]  Jessica J. Fridrich,et al.  Practical steganalysis of digital images: state of the art , 2002, IS&T/SPIE Electronic Imaging.

[7]  Xiaolin Wu,et al.  A new framework of LSB steganalysis of digital media , 2005, IEEE Transactions on Signal Processing.

[8]  Andreas Pfitzmann,et al.  Attacks on Steganographic Systems , 1999, Information Hiding.