A Generalization of LSB Matching

Recently, a significant improvement of the well-known least significant bit (LSB) matching steganography has been proposed, reducing the changes to the cover image for the same amount of embedded secret data. When the embedding rate is 1, this method decreases the expected number of modification per pixel (ENMPP) from 0.5 to 0.375. In this letter, we propose the so-called generalized LSB matching (G-LSB-M) scheme, which generalizes this method and LSB matching. The lower bound of ENMPP for G-LSB-M is investigated, and a construction of G-LSB-M is presented by using the sum and difference covering set of finite cyclic group. Compared with the previous works, we show that the suitable G-LSB-M can further reduce the ENMPP and lead to more secure steganographic schemes. Experimental results illustrate clearly the better resistance to steganalysis of G-LSB-M.

[1]  Bin Li,et al.  Attack LSB Matching Steganography by Counting Alteration Rate of the Number of Neighbourhood Gray Levels , 2007, 2007 IEEE International Conference on Image Processing.

[2]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.

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

[4]  Jessica J. Fridrich,et al.  On Steganographic Embedding Efficiency , 2006, Information Hiding.

[5]  Jessica J. Fridrich,et al.  Detecting LSB Steganography in Color and Gray-Scale Images , 2001, IEEE Multim..

[6]  Toby Sharp,et al.  An Implementation of Key-Based Digital Signal Steganography , 2001, Information Hiding.

[7]  Gérard D. Cohen,et al.  A nonconstructive upper bound on covering radius , 1983, IEEE Trans. Inf. Theory.

[8]  Weiming Zhang,et al.  A Double Layered “Plus-Minus One” Data Embedding Scheme , 2007, IEEE Signal Processing Letters.

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

[10]  Andrew D. Ker.  A Fusion of Maximum Likelihood and Structural Steganalysis , 2007, Information Hiding.

[11]  R. Bosma.  Signed bits and fast exponentiation , 2001 .

[12]  Tieyong Zeng,et al.  Improvement of the embedding efficiency of LSB matching by sum and difference covering set , 2008, 2008 IEEE International Conference on Multimedia and Expo.

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

[14]  J. Mielikainen.  LSB matching revisited , 2006, IEEE Signal Processing Letters.