Computer Science – Cryptography and Security
Scientific paper
2006-06-20
Computer Science
Cryptography and Security
11 pages
Scientific paper
We propose a simple universal (that is, distribution--free) steganographic system in which covertexts with and without hidden texts are statistically indistinguishable. The stegosystem can be applied to any source generating i.i.d. covertexts with unknown distribution, and the hidden text is transmitted exactly, with zero probability of error. 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 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.
Ryabko Boris
Ryabko Daniil
No associations
LandOfFree
Provably Secure Universal Steganographic Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Provably Secure Universal Steganographic Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Provably Secure Universal Steganographic Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-39969