A high-performance YASS-like scheme using randomized big-blocks

Randomly selecting 8 × 8 host blocks in big-blocks for data embedding, YASS [1], a recently developed advanced stegano-graphic scheme makes these blocks not coincident with the 8×8 grids used in JPEG compression. As a result, it effectively invalidates the self-calibration technique used in modern steganaly-sis. However, the randomization is not sufficient enough, i.e., some positions in an image are possible to hold host blocks and some are definitely not. Based on this observation, the newly developed specific steganalyzer [2] can effectively defeat YASS. In this paper, a new steganographic scheme is presented. Through randomizing the size and position of each big-block, our improved steganographic method makes almost every position possible to hold a host block, which has been verified by our statistical analysis. Consequently, the proposed scheme can survive the attack made by the specific steganalyzer. Experimental results have demonstrated that the detection rate achieved by the specific steganalyzer on our proposed method is less than 58%, while that on YASS is about 95% and above.

[1]  J. Wade Davis,et al.  Statistical Pattern Recognition , 2003, Technometrics.

[2]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[3]  Anindya Sarkar,et al.  YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis , 2007, Information Hiding.

[4]  Bin Li,et al.  Steganalysis of YASS , 2009, IEEE Trans. Inf. Forensics Secur..

[5]  Tomás Pevný,et al.  Merging Markov and DCT features for multi-class JPEG steganalysis , 2007, Electronic Imaging.

[6]  Rainer Böhme,et al.  Breaking Cauchy Model-Based JPEG Steganography with First Order Statistics , 2004, ESORICS.

[7]  Jessica J. Fridrich,et al.  Steganalysis of JPEG Images: Breaking the F5 Algorithm , 2002, Information Hiding.

[8]  Niels Provos,et al.  Defending Against Statistical Steganalysis , 2001, USENIX Security Symposium.

[9]  Anindya Sarkar,et al.  Estimation of optimum coding redundancy and frequency domain analysis of attacks for YASS - a randomized block based hiding scheme , 2008, 2008 15th IEEE International Conference on Image Processing.

[10]  Jessica J. Fridrich,et al.  Feature-Based Steganalysis for JPEG Images and Its Implications for Future Design of Steganographic Schemes , 2004, Information Hiding.

[11]  Phil Sallee,et al.  Model-Based Steganography , 2003, IWDW.

[12]  Anindya Sarkar,et al.  Further study on YASS: steganography based on randomized embedding to resist blind steganalysis , 2008, Electronic Imaging.

[13]  Yun Q. Shi,et al.  A Markov Process Based Approach to Effective Attacking JPEG Steganography , 2006, Information Hiding.

[14]  Andreas Westfeld,et al.  F5-A Steganographic Algorithm , 2001, Information Hiding.

[15]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[16]  J. Fridrich,et al.  Attacking the OutGuess , 2002 .