Cryptology ePrint Archive: Report 2002/137

Provably Secure Steganography

Nicholas J. Hopper and John Langford and Luis von Ahn

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.

NOTE: An extended abstract of this paper appeared in CRYPTO 2002. Here we present a full version, including a correction to a small error in Construction 1.

Category / Keywords: foundations / steganography

Publication Info: Appeared in CRYPTO 2002.

Date: received 11 Sep 2002

Contact author: biglou at cs cmu edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20020912:070845 (All versions of this report)

Short URL: ia.cr/2002/137

Discussion forum: Show discussion | Start new discussion