Trellis-coded quantization for public-key steganography

This paper deals with public-key steganography in the presence of a passive warden. The aim is to hide secret messages within cover-documents without making the warden suspicious, and without any preliminar secret key sharing. Whereas a practical attempt has been already done to provide a solution to this problem, it suffers of poor flexibility (since embedding and decoding steps highly depend on cover-signals statistics) and of little capacity compared to recent data hiding techniques. Using the same framework, this paper explores the use of trellis-coded quantization techniques (TCQ and turbo TCQ) to design a more efficient public-key scheme. Experiments on audio signals show great improvements considering Cachin's security criterion.

[1]  Bernd Girod,et al.  Scalar Costa scheme for information embedding , 2003, IEEE Trans. Signal Process..

[2]  Ingemar J. Cox,et al.  Applying informed coding and embedding to design a robust high-capacity watermark , 2004, IEEE Transactions on Image Processing.

[3]  A. Lapidoth,et al.  Generalized writing on dirty paper , 2002, Proceedings IEEE International Symposium on Information Theory,.

[4]  Christian Cachin,et al.  An information-theoretic model for steganography , 1998, Inf. Comput..

[5]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[6]  Gustavus J. Simmons,et al.  The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.

[7]  Ross J. Anderson,et al.  On the limits of steganography , 1998, IEEE J. Sel. Areas Commun..

[8]  Pierre Duhamel,et al.  Applied public-key steganography , 2002, IS&T/SPIE Electronic Imaging.