IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Minimizing the embedding impact in steganography
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Fast communication: Steganography and error-correcting codes
Signal Processing
A coding problem in steganography
Designs, Codes and Cryptography
Constructing good covering codes for applications in steganography
Transactions on data hiding and multimedia security III
A general framework for structural steganalysis of LSB replacement
IH'05 Proceedings of the 7th international conference on Information Hiding
IEEE Transactions on Signal Processing - Part II
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Theory
Capacity and codes for embedding information in gray-scale signals
IEEE Transactions on Information Theory
Grid Colorings in Steganography
IEEE Transactions on Information Theory
Reliable JPEG steganalysis based on multi-directional correlations
Image Communication
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Interpolation of steganographic schemes
Signal Processing
Efficient reversible data hiding in encrypted images
Journal of Visual Communication and Image Representation
Hi-index | 754.84 |
High-performance steganography requires large embedding rate and small distortion, i.e., high embedding efficiency. Steganographic codes (stego-codes) derived from covering codes can improve embedding efficiency. In this paper, a new method is proposed to construct binary stego-codes for LSB embedding in gray-scale signals, which shows that not just one but a family of stego-codes can be generated from a covering code by combining Hamming codes and wet paper codes. This method can greatly expand the set of embedding schemes as applied to steganography. Performances of stego-code families (SCF) of structured codes and random codes are analyzed. SCFs of random codes can approach the rate-distortion bound on LSB embedding for any chosen embedding rate. Furthermore, SCFs are modified for applications in ±1 embedding, and a treble layered embedding method for ±2 embedding is obtained. By combining the modified SCFs and the treble layered method, a near-optimal scheme for ±2 embedding is presented.