Computer Science – Cryptography and Security
Scientific paper
2008-09-09
Information and Computation, 2011, Vol. 209, No. 9, pp. 1223-1230
Computer Science
Cryptography and Security
Scientific paper
10.1016/j.ic.2011.06.004
We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the same; this means that the proposed stegosystems are perfectly secure, i.e. an observer cannot determine whether hidden information is being transmitted. The speed of transmission of hidden information can be made arbitrary close to the theoretical limit - the Shannon entropy of the source of covertexts. An interesting feature of the suggested stegosystems is that they do not require any (secret or public) key. At the same time, we outline some principled computational limitations on steganography. We show that there are such sources of covertexts, that any stegosystem that has linear (in the length of the covertext) speed of transmission of hidden text must have an exponential Kolmogorov complexity. This shows, in particular, that some assumptions on the sources of covertext are necessary.
Ryabko Boris
Ryabko Daniil
No associations
LandOfFree
Constructing Perfect 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 Constructing Perfect Steganographic Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing Perfect Steganographic Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-211095