Using Kolmogorov complexity for understanding some limitations on steganography

Authors:
Boris Ryabko;Daniil Ryabko
Affiliations:
Institute of Computational Technologies of Russian Academy of Science, Siberian State University of Telecommunications and Informatics, Novosibirsk, Russia;INRIA, Lille-Nord, Europe
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 5
Cited 0

An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
Suboptimal measures of predictive complexity for absolute loss function

Information and Computation
Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Minimum description length induction, Bayesianism, and Kolmogorov complexity

IEEE Transactions on Information Theory
Meaningful Information

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Perfectly secure steganographic systems have been recently described for a wide class of sources of covertexts. The speed of transmission of secret information for these stegosystems is proportional to the length of the covertext. In this work we show that there are sources of covertexts for which such stegosystems do not exist. The key observation is that if the set of possible covertexts has a maximal Kolmogorov complexity, then a high-speed perfect stegosystem has to have complexity of the same order.