Estimation of Optimum Coding Redundancy and Frequency Domain Analysis of Attacks for YASS - a Randomized Block Based Hiding Scheme

A. Sarkar, L. Nataraj, B. S. Manjunath and U. Madhow,
Department of Electrical and Computer Engineering,
University of California at Santa Barbara
Santa Barbara, CA 93106


Our recently introduced JPEG steganographic method called Yet Another Steganographic Scheme (YASS) can resist blind steganalysis by embedding data in the discrete cosine transform (DCT) domain in randomly chosen image blocks. To maximize the embedding rate for a given image and a specified attack channel, the redundancy factor used by the repeat accumulate (RA) code based error correction framework in YASS is optimally chosen by the encoder. An efficient method is suggested for the decoder to accurately compute this redundancy factor. We also show experimentally which DCT coefficients are better suited for hiding and detection under various attacks. The effectiveness of YASS for robust steganography is demonstrated for certain attacks.
[PDF] [BibTex]
Anindya Sarkar, Lakshmanan Nataraj, B. S. Manjunath, Upamanyu Madhow,
Proc. IEEE International Conference on Image Processing, pp. 1292-1295, San Diego, CA, Oct. 2008.
Node ID: 506 , DB ID: 313 , Lab: VRL , Target: Conference
Subject: [Digital Watermarking and Data Hiding] « Look up more