Paper 2008/255
Embedding in Two Least Significant Bits with Wet Paper Coding
Xin Liao and Qiao-yan Wen
Abstract
In this paper, we present three embedding schemes for extensions of least significant bit overwriting to both of the two lowest bit planes in digital images. Our approaches are inspired by the work of Fridrich et al. [8] who proposed wet paper coding as an efficient method for steganographic schemes. Our new works generalize it to the embedding in two least significant bits, that is to say, combine two novel extensions of least significant bits embedding and the double-layered embedding developed in [16] with wet paper coding, respectively. The proposed schemes improve steganographic security and are less vulnerable to steganalytic attacks compared with original schemes with shared selection channels between the sender and the recipient.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- information hiding
- Contact author(s)
- liaoxinbupt @ gmail com
- History
- 2008-06-05: received
- Short URL
- https://ia.cr/2008/255
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/255,
author = {Xin Liao and Qiao-yan Wen},
title = {Embedding in Two Least Significant Bits with Wet Paper Coding},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/255},
year = {2008},
url = {https://eprint.iacr.org/2008/255}
}
