Provably Secure Universal Steganographic Systems

Boris Ryabko; Daniil Ryabko

Paper 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.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: Steganography information hiding
Contact author(s): boris @ ryabko net
History: 2006-02-23: received
Short URL: https://ia.cr/2006/063
License: CC BY

BibTeX

@misc{cryptoeprint:2006/063,
      author = {Boris Ryabko and Daniil Ryabko},
      title = {Provably Secure Universal Steganographic Systems},
      howpublished = {Cryptology ePrint Archive, Paper 2006/063},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/063}},
      url = {https://eprint.iacr.org/2006/063}
}