Approaching maximum embedding efficiency on small covers using Staircase-Generator codes

We introduce a new family of binary linear codes suitable for steganographic matrix embedding. The main characteristic of the codes is the staircase random block structure of the generator matrix. We propose an efficient list decoding algorithm for the codes that finds a close codeword to a given random word. We provide both theoretical analysis of the performance and stability of the decoding algorithm, as well as practical results. Used for matrix embedding, these codes achieve almost the upper theoretical bound of the embedding efficiency for covers in the range of 1000 - 1500 bits, which is at least an order of magnitude smaller than the values reported in related works.

[1]  Weiming Zhang,et al.  Near-Optimal Codes for Information Embedding in Gray-Scale Signals , 2010, IEEE Transactions on Information Theory.

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

[3]  William A. Pearlman,et al.  Capacity of Steganographic Channels , 2005, IEEE Transactions on Information Theory.

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

[5]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

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

[7]  Weiming Zhang,et al.  Efficient Matrix Embedding Based on Random Linear Codes , 2010, 2010 International Conference on Multimedia Information Networking and Security.

[8]  Jessica J. Fridrich,et al.  Practical methods for minimizing embedding impact in steganography , 2007, Electronic Imaging.

[9]  Weiming Zhang,et al.  Fast Matrix Embedding by Matrix Extending , 2012, IEEE Transactions on Information Forensics and Security.

[10]  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..

[11]  Weiwei Liu,et al.  Adaptive steganography based on block complexity and matrix embedding , 2013, Multimedia Systems.

[12]  Yunkai Gao,et al.  Improving embedding efficiency via matrix embedding: A case study , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[13]  Jessica J. Fridrich,et al.  Matrix embedding for large payloads , 2006, IEEE Transactions on Information Forensics and Security.

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

[15]  N. J. A. Sloane,et al.  On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.

[16]  Ingemar J. Cox,et al.  Digital Watermarking and Steganography , 2014 .

[17]  Jessica J. Fridrich,et al.  Constructing Good Covering Codes for Applications in Steganography , 2008, Trans. Data Hiding Multim. Secur..

[18]  Iliya Bouyukliev,et al.  On the least covering radius of binary linear codes of dimension 6 , 2010, Adv. Math. Commun..

[19]  Qian Mao,et al.  A fast algorithm for matrix embedding steganography , 2014, Digit. Signal Process..