Abstract
An information-theoretic model for steganography with passive adversaries is proposed. The adversary’s task of distinguishing between an innocent cover message C and a modified message S containing a secret part is interpreted as a hypothesis testing problem. The security of a steganographic system is quantified in terms of the relative entropy (or discrimination) between P C and P S. Several secure steganographic schemes are presented in this model; one of them is a universal information hiding scheme based on universal data compression techniques that requires no knowledge of the covertext statistics.
Research supported by the Swiss National Science Foundation (SNF).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Anderson, ed., Information Hiding, vol. 1174 of Lecture Notes in Computer Science, Springer, 1996.
R. J. Anderson and F. A. Petitcolas, “On the limits of steganography,” IEEE Journal on Selected Areas in Communications, vol. 16, May 1998.
T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression. Prentice Hall, 1990.
W. Bender, D. Gruhl, N. Morimoto, and A. Lu, “Techniques for data hiding,” IBM Systems Journal, vol. 35, no. 3 & 4, 1996.
J. O. Berger, Statistical Decision Theory and Bayesian Analysis. Springer, 2. ed., 1985.
R. E. Blahut, Principles and Practice of Information Theory. Reading: Addison-Wesley, 1987.
T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.
I. J. Cox, J. Kilian, T. Leighton, and T. Shamoon, “A secure, robust watermark for multimedia,” in Information Hiding (R. Anderson, ed.), vol. 1174 of Lecture Notes in Computer Science, Springer, 1996.
P. Elias, “Interval and recency rank source coding: two on-line adaptive variablelength schemes,” IEEE Transactions on Information Theory, vol. 33, pp. 3–10, Jan. 1987.
M. Ettinger, “Steganalysis and game equilibria,” in Proc. 2nd Workshop on Information Hiding (D. Aucsmith, ed.), Lecture Notes in Computer Science, Springer-Verlag, 1998.
J. L. Massey, “Contemporary cryptography: An introduction,” in Contemporary Cryptology: The Science of Information Integrity (G. J. Simmons, ed.), ch. 1, pp. 1–39, IEEE Press, 1991.
U. M. Maurer, “A unified and generalized treatment of authentication theory,” in Proc. 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS) (C. Puech and R. Reischuk, eds.), vol. 1046 of Lecture Notes in Computer Science, pp. 190–198, Springer, 1996.
M. Naor, A. Fiat, and B. Chor, “Tracing traitors,” in Advances in Cryptology: CRYPTO’ 94 (Y. G. Desmedt, ed.), vol. 839 of Lecture Notes in Computer Science, 1994.
M. Naor and A. Shamir, “Visual cryptography,” in Advances in Cryptology: EUROCRYPT’ 94 (A. De Santis, ed.), vol. 950 of Lecture Notes in Computer Science, pp. 1–12, Springer, 1995.
B. Pfitzmann, “Information hiding terminology,” in Information Hiding (R. Anderson, ed.), vol. 1174 of Lecture Notes in Computer Science, Springer, 1996.
B. Pfitzmann and M. Schunter, “Asymmetric fingerprinting,” in Advances in Cryptology: EUROCRYPT’ 96 (U. Maurer, ed.), vol. 1233 of Lecture Notes in Computer Science, Springer, 1996.
B. Pfitzmann and M. Waidner, “Anonymous fingerprinting,” in Advances in Cryptology: EUROCRYPT’ 97 (W. Fumy, ed.), vol. 1070 of Lecture Notes in Computer Science, Springer, 1997.
C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal, vol. 27, pp. 379–423, 623-656, July, Oct. 1948.
G. J. Simmons, “The prisoners’ problem and the subliminal channel,” in Advances in Cryptology: Proceedings of Crypto 83 (D. Chaum, ed.), pp. 51–67, Plenum Press, 1984.
G. J. Simmons, “Authentication theory/coding theory,” in Advances in Cryptology: Proceedings of CRYPTO 84 (G. R. Blakley and D. Chaum, eds.), vol. 196 of Lecture Notes in Computer Science, Springer, 1985.
G. J. Simmons, “An introduction to shared secret and/or shared control schemes and their application,” in Contemporary Cryptology: The Science of Information Integrity (G. J. Simmons, ed.), pp. 441–497, IEEE Press, 1991.
F. M. Willems, “Universal data compression and repetition times,” IEEE Transactions on Information Theory, vol. 35, pp. 54–58, Jan. 1989.
J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Transactions on Information Theory, vol. 23, pp. 337–343, May 1977.
J. Zöllner, H. Federrath, H. Klimant, A. Pfitzmann, R. Piotraschke, A. Westfeld, G. Wicke, and G. Wolf, “Modeling the security of steganographic systems,” in Proc. 2nd Workshop on Information Hiding (D. Aucsmith, ed.), Lecture Notes in Computer Science, Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cachin, C. (1998). An Information-Theoretic Model for Steganography. In: Aucsmith, D. (eds) Information Hiding. IH 1998. Lecture Notes in Computer Science, vol 1525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49380-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-49380-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65386-8
Online ISBN: 978-3-540-49380-8
eBook Packages: Springer Book Archive