A generalization of LSB matching

Xiaolong Li; Bin Yang; Daofang Cheng; Tieyong Zeng

doi:10.1109/LSP.2008.2008947

A generalization of LSB matching

Xiaolong Li^*, Bin Yang, Daofang Cheng, Tieyong Zeng

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

112 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	69-72
Number of pages	4
Journal	IEEE Signal Processing Letters
Volume	16
Issue number	2
DOIs	https://doi.org/10.1109/LSP.2008.2008947
Publication status	Published - Feb 2009

Scopus Subject Areas

Signal Processing
Electrical and Electronic Engineering
Applied Mathematics

User-Defined Keywords

Generalized least significant bit (LSB) matching (G-LSB-M)
Information hiding
Least significant bit (LSB) matching
Steganography
Sum and difference covering set

Access to Document

10.1109/LSP.2008.2008947

Cite this

@article{5b92f97e3b0d46f08342951b3929201c,

title = "A generalization of LSB matching",

abstract = "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.",

keywords = "Generalized least significant bit (LSB) matching (G-LSB-M), Information hiding, Least significant bit (LSB) matching, Steganography, Sum and difference covering set",

author = "Xiaolong Li and Bin Yang and Daofang Cheng and Tieyong Zeng",

year = "2009",

month = feb,

doi = "10.1109/LSP.2008.2008947",

language = "English",

volume = "16",

pages = "69--72",

journal = "IEEE Signal Processing Letters",

issn = "1070-9908",

publisher = "IEEE",

number = "2",

}

TY - JOUR

T1 - A generalization of LSB matching

AU - Li, Xiaolong

AU - Yang, Bin

AU - Cheng, Daofang

AU - Zeng, Tieyong

PY - 2009/2

Y1 - 2009/2

N2 - 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.

AB - 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.

KW - Generalized least significant bit (LSB) matching (G-LSB-M)

KW - Information hiding

KW - Least significant bit (LSB) matching

KW - Steganography

KW - Sum and difference covering set

UR - http://www.scopus.com/inward/record.url?scp=59149086522&partnerID=8YFLogxK

U2 - 10.1109/LSP.2008.2008947

DO - 10.1109/LSP.2008.2008947

M3 - Journal article

AN - SCOPUS:59149086522

SN - 1070-9908

VL - 16

SP - 69

EP - 72

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

IS - 2

ER -

A generalization of LSB matching

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this