Constructing perfect steganographic systems

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

[1]  V. Uspenskii,et al.  Can an individual sequence of zeros and ones be random? Russian Math , 1990 .

[2]  L. D. Davisson,et al.  Comments on "Sequence time coading for data compression" , 1966 .

[3]  Vladimir V. V'yugin,et al.  Suboptimal Measures of Predictive Complexity for Absolute Loss Function , 2002, Inf. Comput..

[4]  Ming Li,et al.  Minimum description length induction, Bayesianism, and Kolmogorov complexity , 1999, IEEE Trans. Inf. Theory.

[5]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[6]  T. J. Lynch,et al.  Sequence time coding for data compression , 1966 .

[7]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[8]  Y. Peres.  Iterating Von Neumann's Procedure for Extracting Random Bits , 1992 .

[9]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

[10]  Jehoshua Bruck,et al.  Efficient Generation of Random Bits From Finite State Markov Chains , 2012, IEEE Transactions on Information Theory.

[11]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[12]  Ueli Maurer,et al.  Information-Theoretic Cryptography , 1999, CRYPTO.

[13]  P. Elias.  The Efficient Construction of an Unbiased Random Sequence , 1972 .

[14]  R. E. Krichevskii.  Universal Compression and Retrieval , 1994 .

[15]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[16]  Boris Ryabko,et al.  Using Kolmogorov complexity for understanding some limitations on steganography , 2009, 2009 IEEE International Symposium on Information Theory.

[17]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[18]  Christian Cachin,et al.  An information-theoretic model for steganography , 1998, Inf. Comput..

[19]  Daniil Ryabko,et al.  Asymptotically optimal perfect steganographic systems , 2009, Probl. Inf. Transm..

[20]  Boris Ryabko,et al.  Fast enumeration of combinatorial objects , 2006, ArXiv.

[21]  Andrei Fionov,et al.  Basics of Contemporary Cryptography for IT Practitioners , 2005, Series on Coding Theory and Cryptology.

[22]  O. F. Cook.  The Method of Types , 1898 .

[23]  Gustavus J. Simmons,et al.  The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.

[24]  Boris Ryabko,et al.  Information-Theoretic Approach to Steganographic Systems , 2007, 2007 IEEE International Symposium on Information Theory.

[25]  R. Gallager.  Information Theory and Reliable Communication , 1968 .