Principles and practice of information theory
Principles and practice of information theory
Stretching the Limits of Steganography
Proceedings of the First International Workshop on Information Hiding
Distributed Source Coding Using Syndromes (DISCUS): Design and Construction
DCC '99 Proceedings of the Conference on Data Compression
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Perturbed quantization steganography with wet paper codes
Proceedings of the 2004 workshop on Multimedia and security
An information-theoretic approach to the design of robust digital watermarking systems
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04
Distributed source coding using syndromes (DISCUS): design and construction
IEEE Transactions on Information Theory
On the limits of steganography
IEEE Journal on Selected Areas in Communications
Applying informed coding and embedding to design a robust high-capacity watermark
IEEE Transactions on Image Processing
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Hamiltonian graph approach to steganography
International Journal of Electronic Security and Digital Forensics
Hiding Message in Map Along Pre-Hamiltonian Path
International Journal of Information Security and Privacy
| Hi-index | 0.00 |
Recently there has been strong interest in developing models of steganography based on information theory. Previous work has considered under what conditions the security of the stegosystem can be guaranteed and the number of bits that can then be embedded in a cover Work. This work implicitly assumes that the hidden message is uncorrelated with the cover Work, the latter simply being used to conceal the hidden message. Here, we consider the case in which the cover Work is chosen such that it is correlated with the covert message. In this situation, the number of bits needed to encode the hidden message can be considerably reduced. We discuss the information that can then be transmitted and show that it is substantially greater than simply the number of embedded bits. We also note that the security of the system as defined by Cachin need not be compromised. However, the Shannon security may be compromised, but it remains unclear to what extent. Experimental results are presented that demonstrate the fundamental concepts.