Annual International Cryptology Conference

CRYPTO 2002: Advances in Cryptology — CRYPTO 2002 pp 77-92

Provably Secure Steganography

Extended Abstract
  • Nicholas J. Hopper
  • John Langford
  • Luis von Ahn
Conference paper

DOI: 10.1007/3-540-45708-9_6

Volume 2442 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Hopper N.J., Langford J., von Ahn L. (2002) Provably Secure Steganography. In: Yung M. (eds) Advances in Cryptology — CRYPTO 2002. CRYPTO 2002. Lecture Notes in Computer Science, vol 2442. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

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