## CryptoDB

### Paper: Provably Secure Steganography

Authors: Nicholas J. Hopper John Langford Luis von Ahn URL: http://eprint.iacr.org/2002/137 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2002-11660,
title={Provably Secure Steganography},
booktitle={IACR Eprint archive},
keywords={foundations / steganography},
url={http://eprint.iacr.org/2002/137},
note={Appeared in CRYPTO 2002. biglou@cs.cmu.edu 11941 received 11 Sep 2002},
author={Nicholas J. Hopper and John Langford and Luis von Ahn},
year=2002
}