On Steganographic Embedding Efficiency

In this paper, we study embedding efficiency, which is an important attribute of steganographic schemes directly influencing their security. It is defined as the expected number of embedded random message bits per one embedding change. Constraining ourselves to embedding realized using linear covering codes (so called matrix embedding), we show that the quantity that determines embedding efficiency is not the covering radius but the average distance to code. We demonstrate that for linear codes of fixed block length and dimension, the highest embedding efficiency (the smallest average distance to code) is not necessarily achieved using codes with the smallest covering radius. Nevertheless, we prove that with increasing code length and fixed rate (i.e., fixed relative message length), the relative average distance to code and the relative covering radius coincide. Finally, we describe several specific examples of q-ary linear codes with q matched to the embedding operation and experimentally demonstrate the improvement in steganographic security when incorporating the coding methods to digital image steganography.

[1]  Gregory A. Kabatiansky,et al.  Information hiding by coverings , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[2]  Jessica J. Fridrich,et al.  Perturbed quantization steganography , 2005, Multimedia Systems.

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

[4]  Jessica J. Fridrich,et al.  Maximum likelihood estimation of length of secret message embedded using ±k steganography in spatial domain , 2005, IS&T/SPIE Electronic Imaging.

[5]  Andrew D. Ker A General Framework for Structural Steganalysis of LSB Replacement , 2005, Information Hiding.

[6]  Miroslav Goljan,et al.  Steganalysis based on JPEG compatibility , 2001, SPIE ITCom.

[7]  Jessica J. Fridrich,et al.  Matrix embedding for large payloads , 2006, IEEE Trans. Inf. Forensics Secur..

[8]  R. Crandall,et al.  Some Notes on Steganography , 1999 .

[9]  Martin J. Wainwright,et al.  Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  Jessica J. Fridrich,et al.  New blind steganalysis and its implications , 2006, Electronic Imaging.

[11]  Andreas Westfeld,et al.  F5—A Steganographic Algorithm High Capacity Despite Better Steganalysis , 2001 .

[12]  Miroslav Goljan,et al.  Steganography via Codes for Memory with Defective Cells , 2022 .

[13]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[14]  Andrew D. Ker Resampling and the detection of LSB matching in color bitmaps , 2005, IS&T/SPIE Electronic Imaging.

[15]  Hong Chen,et al.  On steganalysis of plus-minus one embedding of continuous-tone images , 2005, IS&T/SPIE Electronic Imaging.

[16]  Phil Sallee,et al.  Model-Based Methods For Steganography And Steganalysis , 2005, Int. J. Image Graph..

[17]  Andrew D. Ker Steganalysis of LSB matching in grayscale images , 2005, IEEE Signal Processing Letters.

[18]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[19]  Jessica J. Fridrich,et al.  Wet paper codes with improved embedding efficiency , 2006, IEEE Transactions on Information Forensics and Security.

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

[21]  Juergen Bierbrauer Introduction to coding theory , 2005, Discrete mathematics and its applications.

[22]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

[23]  Marten van Dijk,et al.  Embedding Information in Grayscale Images , 2001 .

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