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
The square root law does not require a linear key
Proceedings of the 12th ACM workshop on Multimedia and security
Generalization and analysis of the paper folding method for steganography
IEEE Transactions on Information Forensics and Security
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Data embedding in image-media using weight-function on modulo operations
ACM Transactions on Embedded Computing Systems (TECS) - Special issue on embedded systems for interactive multimedia services (ES-IMS)
New channel selection criterion for spatial domain steganography
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
A study of optimal matrix for efficient matrix embedding in F3
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Interpolation of steganographic schemes
Signal Processing
Hi-index | 0.00 |
For good security and large payload in steganography, it is desired to embed as many messages as possible per change of the cover-object, i.e., to have high embedding efficiency. Steganographic codes derived from covering codes can improve embedding efficiency. In this paper, we propose a new method to construct stego-codes, showing that not just one but a family of stego-codes can be generated from one covering code by combining Hamming codes and wet paper codes. This method can enormously expand the set of embedding schemes as applied in steganography. Performances of stego-code families of structured codes and random codes are analyzed. By using the stego-code families of LDGM codes, we obtain a family of near optimal embedding schemes for binary steganography and ±1 steganography, respectively, which can approach the upper bound of embedding efficiency for various chosen embedding rate.