An Information-Theoretic Model for Steganography

  • Christian Cachin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1525)

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 PC and PS. 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Anderson, ed., Information Hiding, vol. 1174 of Lecture Notes in Computer Science, Springer, 1996.Google Scholar
  2. 2.
    R. J. Anderson and F. A. Petitcolas, “On the limits of steganography,” IEEE Journal on Selected Areas in Communications, vol. 16, May 1998.Google Scholar
  3. 3.
    T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression. Prentice Hall, 1990.Google Scholar
  4. 4.
    W. Bender, D. Gruhl, N. Morimoto, and A. Lu, “Techniques for data hiding,” IBM Systems Journal, vol. 35, no. 3 & 4, 1996.Google Scholar
  5. 5.
    J. O. Berger, Statistical Decision Theory and Bayesian Analysis. Springer, 2. ed., 1985.Google Scholar
  6. 6.
    R. E. Blahut, Principles and Practice of Information Theory. Reading: Addison-Wesley, 1987.MATHGoogle Scholar
  7. 7.
    T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    M. Ettinger, “Steganalysis and game equilibria,” in Proc. 2nd Workshop on Information Hiding (D. Aucsmith, ed.), Lecture Notes in Computer Science, Springer-Verlag, 1998.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.CrossRefGoogle Scholar
  15. 15.
    B. Pfitzmann, “Information hiding terminology,” in Information Hiding (R. Anderson, ed.), vol. 1174 of Lecture Notes in Computer Science, Springer, 1996.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    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.Google Scholar
  18. 18.
    C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal, vol. 27, pp. 379–423, 623-656, July, Oct. 1948.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    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.Google Scholar
  21. 21.
    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.Google Scholar
  22. 22.
    F. M. Willems, “Universal data compression and repetition times,” IEEE Transactions on Information Theory, vol. 35, pp. 54–58, Jan. 1989.Google Scholar
  23. 23.
    J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Transactions on Information Theory, vol. 23, pp. 337–343, May 1977.Google Scholar
  24. 24.
    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.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Christian Cachin
    • 1
  1. 1.MIT Laboratory for Computer ScienceCambridgeUSA

Personalised recommendations