Provable Secure Universal Steganography of Optimal Rate


We present the first complexity-Theoretic secure steganographic protocol which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. Our system is unconditionally secure, i.e. our proof does not rely on any unproven complexity-Theoretic assumption, like e.g. the existence of one-way functions. This disproves the claim that the existence of one-way functions and access to a communication channel oracle are both necessary and sufficient conditions for the existence of secure steganography, in the sense that secure and reliable steganography exists independently of the existence of one-way functions.

Original languageEnglish
Title of host publicationIH&MMSec '16
Number of pages12
Place of PublicationNew York, NY, USA
Publication date20.06.2016
ISBN (Print)978-1-4503-4290-2
Publication statusPublished - 20.06.2016
EventInformation Hiding and Multimedia Security - Vigo, Spain
Duration: 20.06.201622.06.2016


Dive into the research topics of 'Provable Secure Universal Steganography of Optimal Rate'. Together they form a unique fingerprint.

Cite this