Chapter

Advances in Cryptology — CRYPTO 2002

Volume 2442 of the series Lecture Notes in Computer Science pp 77-92

Date:

Provably Secure Steganography

Extended Abstract
  • Nicholas J. HopperAffiliated withComputer Science Department, Carnegie Mellon University
  • , John LangfordAffiliated withComputer Science Department, Carnegie Mellon University
  • , Luis von AhnAffiliated withComputer Science Department, Carnegie Mellon University

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.