Title :
Using Kolmogorov complexity for understanding some limitations on steganography
Author :
Ryabko, Boris ; Ryabko, Daniil
Author_Institution :
Inst. of Comput. Technol. of Siberian Branch, Siberian State Univ. of Telecommun. & Inf., Novosibirsk, Russia
fDate :
June 28 2009-July 3 2009
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.
Keywords :
steganography; maximal Kolmogorov complexity; steganographic system; steganography; stegosystem; Containers; Decoding; Entropy; Europe; H infinity control; Informatics; Roentgenium; Steganography; Telecommunication computing; Videos;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205847
