Biblio
Filters: Author is Berndt, Sebastian [Clear All Filters]
.
2016. Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography Does Not Necessarily Imply One-Way Functions. Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security. :81–92.
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.