Provably Secure Steganography

  • Authors:
  • Nicholas J. Hopper;John Langford;Luis von Ahn

  • Affiliations:
  • -;-;-

  • Venue:
  • CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.