An information-theoretic model for steganography

Information and Computation

Volumn 192, Issue 1, 2004, Pages 41-56

  Cachin, Christian ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Covert channel; Information hiding; One time pad; Perfect security; Subliminal channel; Universal data compression

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CRYPTOGRAPHY; ENTROPY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

COVERT CHANNELS; INFORMATION HIDING; STEGANOGRAPHY; SUBLIMINAL CHANNEL; UNIVERSAL DATA COMPRESSION;

INFORMATION ANALYSIS;

EID: 3042519430     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.02.003     Document Type: Article

References (17)

1. Simmons G.J. The Prisoners' Problem and the subliminal channel. Chaum D. Advances in Cryptology: Proceedings of Crypto. 83:1984;51-67 Plenum Press, New York.
2. Blahut R.E. Principles and Practice of Information Theory. 1987;Addison-Wesley, Reading, MA.
3. Cover T.M., Thomas J.A. Elements of Information Theory. 1991;Wiley, New York.
4. Pfitzmann B. Information hiding terminology. Anderson R. Information Hiding, First International Workshop. Lecture Notes in Computer Science. vol. 1174:1996;347-350 Springer, Berlin.
5. Shannon C.E. Communication theory of secrecy systems. Bell Syst. Tech. J. 28:1949;656-715.
6. Mittelholzer T. An information-theoretic approach to steganography and watermarking. Pfitzmann A. Information Hiding, Third International Workshop, IH'99. vol. 1768, Lecture Notes in Computer Science. 1999;1-16 Springer, Berlin.
7. Maurer U. Authentication theory and hypothesis testing. IEEE Trans. Inform. Theory. 46:(4):2000;1350-1356.
8. Naor M., Shamir A. Visual cryptography. De Santis A. Advances in Cryptology: EUROCRYPT '94. vol. 950, Lecture Notes in Computer Science. 1995;1-12 Springer, Berlin.
9. Garey M.R., Johnson D.S. Computers and Intractability - A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman, New York.
10. Bell T.C., Cleary J.G., Witten I.H. Text Compression. 1990;Prentice-Hall, Englewood Cliffs, NJ.
11. Csiszár I., Körner J. Information Theory: Coding Theorems for Discrete Memoryless Systems. 1981;Academic Press, New York.
12. Csiszár I. The method of types. IEEE Trans. Inform. Theory. 44:(6):1998;2505-2523.
13. Cox I.J., Miller M.L., Bloom J.A. Digital Watermarking. 2002;Morgan Kaufmann, Los Altos, CA.
14. Ettinger M. Steganalysis and game equilibria. Aucsmith D. Information Hiding, Second International Workshop. vol. 1525, Lecture Notes in Computer Science. 1998;319-328 Springer, Berlin.
15. Zöllner J., Federrath H., Klimant H., Pfitzmann A., Piotraschke R., Westfeld A., Wicke G., Wolf G. Modeling the security of steganographic systems. Aucsmith D. Information Hiding, Second International Workshop. vol. 1525, Lecture Notes in Computer Science. 1998;344-354 Springer, Berlin.
16. Hopper N.J., Langford J., von Ahn L. Provably secure steganography. Yung M. Advances in Cryptology: CRYPTO 2002. vol. 2442, Lecture Notes in Computer Science. 2002;77-92 Springer, Berlin.
17. Katzenbeisser S., Petitcolas F.A.P. Defining security in steganographic systems. Delp E.J., Won P.W. Security and Watermarking of Multimedia Contents IV. vol. 4675, Proceedings of SPIE. 2002;260-268.