Provably Secure Steganography

Extended Abstract
  • Nicholas J. Hopper
  • John Langford
  • Luis von Ahn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2442)

Abstract

Informally, steganography is the process of sending a secret message from Alice to Bob in such a way that an eavesdropper (who listens to all communications) cannot even tell that a secret message is being sent. In this work, we initiate the study of steganography from a complexity-theoretic point of view. We introduce definitions based on computational indistinguishability and we prove that the existence of one-way functions implies the existence of secure steganographic protocols.

References

  1. 1.
    Ross J. Anderson and Fabien A. P. Petitcolas. On The Limits of Steganography. IEEE Journal of Selected Areas in Communications, 16(4). May 1998.Google Scholar
  2. 2.
    Mihir Bellare and Chanathip Namprempre. Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm. In: Advances in Cryptology — Asiacrypt’ 00. December 2000.Google Scholar
  3. 3.
    C. Cachin. An Information-Theoretic Model for Steganography. In: Information Hiding — Second International Workshop, Preproceedings. April 1998.Google Scholar
  4. 4.
    Oded Goldreich, Shafi Goldwasser and Silvio Micali. How to Construct Random Functions. Journal of the ACM, 33(4):792–807, 1986.CrossRefMathSciNetGoogle Scholar
  5. 5.
    Johan Hastad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364–1396, 1999.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Nicholas J. Hopper, John Langford, and Luis von Ahn. Provably Secure Steganography. CMU Tech Report CMU-CS-TR-02-149, 2002.Google Scholar
  7. 7.
    Russell Impagliazzo and Michael Luby. One-way Functions are Essential for Complexity Based Cryptography. In: 30th FOCS, November 1989.Google Scholar
  8. 8.
    D. Kahn. The Code Breakers. Macmillan 1967.Google Scholar
  9. 9.
    Stefan Katzenbeisser and Fabien A. P. Petitcolas. Information hiding techniques for steganography and digital watermarking. Artech House Books, 1999.Google Scholar
  10. 10.
    T. Mittelholzer. An Information-Theoretic Approach to Steganography and Watermarking In: Information Hiding — Third International Workshop. 2000.Google Scholar
  11. 11.
    J. A. O’sullivan, P. Moulin, and J. M. Ettinger Information theoretic analysis of Steganography. In: Proceedings ISIT’ 98. 1998.Google Scholar
  12. 12.
    Phillip Rogaway, Mihir Bellare, John Black and Ted Krovetz. OCB: A Block-Cipher Mode of Operation for Efficient Authenticated Encryption. In: Proceedings of the Eight ACM Conference on Computer and Communications Security (CCS-8). November 2001.Google Scholar
  13. 13.
    G.J. Simmons. The Prisoner’s Problem and the Subliminal Channel. In: Proceedings of CRYPTO’ 83. 1984.Google Scholar
  14. 14.
    J Zollner, H. Federrath, H. Klimant, A. Pftizmann, R. Piotraschke, A. Westfield, G. Wicke, G. Wolf. Modeling the security of steganographic systems. In: Information Hiding — Second International Workshop, Preproceedings. April 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Nicholas J. Hopper
    • 1
  • John Langford
    • 1
  • Luis von Ahn
    • 1
  1. 1.Computer Science DepartmentCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations