Cryptology ePrint Archive: Report 2006/063
Provably Secure Universal Steganographic Systems
Boris Ryabko and Daniil Ryabko
Abstract: We propose a simple universal (that is, distribution--free) steganographic system
in which covertexts with and without hidden texts are statistically indistinguishable.
Moreover, the proposed steganographic system has two important properties. First, the rate of transmission of hidden information approaches the Shannon entropy
of the covertext source as the size of blocks used for hidden text encoding tends to infinity.
Second, if the size of the alphabet of the covertext source and its minentropy tend to infinity
then the the number of bits of hidden text per letter of covertext tends to $\log(n!)/n$ where $n$
is the (fixed) size of blocks used for hidden text encoding. The proposed stegosystem uses randomization.
Category / Keywords: Steganography, information hiding
Date: received 18 Feb 2006
Contact author: boris at ryabko net
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20060223:223108 (All versions of this report)
Short URL: ia.cr/2006/063
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]