Abstract
In 1998 C. Cachin proposed an information-theoretic approach to steganography. In particular, in the framework of this approach, so-called perfectly secure stegosystems were defined, where messages that carry and do not carry hidden information are statistically indistinguishable. There was also described a universal steganographic system, for which this property holds only asymptotically, as the message length grows, while encoding and decoding complexity increases exponentially. (By definition, a system is universal if it is also applicable in the case where probabilistic characteristics of messages used to transmit hidden information are not known completely.)
In the present paper we propose a universal steganographic system where messages that carry and do not carry hidden information are statistically indistinguishable, while transmission rate of “hidden” information approaches the limit, the Shannon entropy of the source used to “embed” the hidden information.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cachin, C., An Information-Theoretic Model for Steganography, Proc. 2nd Int. Workshop on Information Hiding, Portland, USA, 1998, Aucsmith, D., Ed., Lect. Notes Comp. Sci., vol. 1525, Berlin: Springer, 1998, pp. 306–318.
Ryabko, B.Ya. and Fionov, A.N., Kriptograficheskie metody zashchity informatsii (Cryptographic Data Protection Methods), Moscow: Telekom, 2005.
Menezes, A.J., van Oorschot, P.C., and Vanstone, S.A., Handbook of Applied Cryptography, Boca Raton: CRC Press, 1997.
Sallee, P., Model-Based Steganography, Proc. 2nd Int. Workshop on Digital Watermarking (IWDW’03), Seoul, Korea, Kalker, T., Cox, I.J., and Ro, Y.M., Eds., Lect. Notes Comp. Sci., vol. 2939, Berlin: Springer, 2004, pp. 154–167.
Mittelholzer, T., An Information-Theoretic Approach to Steganography and Watermarking, Proc. 3rd Int. Workshop on Information Hiding (IH’99), Dresden, Germany, Pfitzmann, A., Ed., Lect. Notes Comp. Sci., vol. 1768, Berlin: Springer, 2000, pp. 1–16.
von Neumann, J., Various Techniques Used in Connection with Random Digits, in Monte Carlo Method (Proc. Sympos. Held in Los Angeles, California, 1949), Appl.Math. Ser., vol. 12, Washington: U.S. Govt. Print. Off., 1951, pp. 36–38.
Elias, P., The Efficient Construction of an Unbiased Random Sequence, Ann. Math. Stat., 1972, vol. 43, no. 3, pp. 864–870.
Csiszár, I., The Method of Types. Information Theory: 1948–1998, IEEE Trans. Inform. Theory, 1998, vol. 44, no. 6, pp. 2505–2523.
Gallager, R.G., Information Theory and Reliable Communication, New York: Wiley, 1968. Translated under the title Teoriya informatsii i nadezhnaya svyaz’, Moscow: Sov. Radio, 1974.
Ryabko, B.Ya., Fast Enumeration of Combinatorial Objects, Diskret. Mat., 1998, vol. 10, no. 2, pp. 101–119 [Discrete Math. Appl. (Engl. Transl.), 2998, vol. 8, no. 2, pp. 163–182].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © B.Ya. Ryabko, D.B. Ryabko, 2009, published in Problemy Peredachi Informatsii, 2009, Vol. 45, No. 2, pp. 119–126.
Supported in part by the Russian Foundation for Basic Research, project no. 06-07-89025.
Rights and permissions
About this article
Cite this article
Ryabko, B.Y., Ryabko, D.B. Asymptotically optimal perfect steganographic systems. Probl Inf Transm 45, 184–190 (2009). https://doi.org/10.1134/S0032946009020094
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946009020094