Introduction
Steganography is the art and science of hiding information by embedding messages within other, seemingly harmless messages. Steganography means “covered writing” in Greek. As the goal of steganography is to hide the presence of a message and to create a covert channel, it can be seen as the complement of cryptography, whose goal is to hide the content of a message.
A famous illustration of steganography is Simmons' “Prisoners’ Problem” [10]: Alice and Bob are in jail, locked up in separate cells far apart from each other, and wish to devise an escape plan. They are allowed to communicate by means of sending messages via trusted couriers, provided they do not deal with escape plans. But the couriers are agents of the warden Eve (who plays the role of the adversary here) and will leak all communication to her. If Eve detects any sign of conspiracy, she will thwart the escape plans by transferring both prisoners to high-security cells from which nobody has ever escaped....
This is a preview of subscription content, log in via an institution.
References
Anderson, R.J. and F.A. Petitcolas (1998). “On the limits of steganography.” IEEE Journal on Selected Areas in Communications, 16.
Backes, M. and C. Cachin (2005). “Public-key steganography with active attacks.” Proceedings 2nd Theory of Cryptography Conference (TCC 2005), Lecture Notes in Computer Science, vol. 3378, ed. J. Kilian. Springer, Berlin, 210–226.
Cachin, C. (2004). “An information-theoretic model for steganography.” Information and Computation, vol. 192, pp. 41–56. (Preliminary version appeared in Proc. 2nd Workshop on Information Hiding, Lecture Notes in Computer Science, vol. 1525, Springer, Berlin, 1998).
Goldreich, O. (2001). Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge.
Hopper, N.J., J. Langford, and L. von Ahn (2002). “Provably secure steganography.” Advances in Cryptology—CRYPTO 2002, Lecture Notes in Computer Science, vol. 2442, ed. M. Yung. Springer, Berlin.
Katzenbeisser, S. and F.A.P. Petitcolas (2002). “Defining security in steganographic systems.” Security and Watermarking of Multimedia Contents IV, Proceedings of SPIE, International Society for Optical Engineering, vol. 4675, eds. E.J. Delp and P.W. Won, 260–268.
Naor, M. and A. Shamir (1995). “Visual cryptography.” Advances in Cryptology—EUROCRYPT'94, Lecture Notes in Computer Science, vol. 950, ed. A. De Santis. Springer, Berlin, 1–12.
Pfitzmann, B. (1996). “Information hiding terminology.” Information Hiding, First International Workshop, Lecture Notes in Computer Science, vol. 1174, ed. R. Anderson. Springer, Berlin, 347–350.
Shannon, C.E. (1949). “Communication theory of secrecy systems.” Bell System Technical Journal, (28), 656–715.
Simmons, G.J. (1984). “The prisoners' problem and the subliminal channel.” Advances in Cryptology—CRYPTO'83, Lecture Notes in Computer Science, ed. D. Chaum. Plenum, New York, 51–67.
von Ahn, L. and N.J. Hopper (2004). “Public-key steganography.” Advances in Cryptology–EUROCRYPT 2004, Lecture Notes in Computer Science, vol. 3027, eds. C. Cachin and J. Camenisch. Springer, Berlin, 322–339.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Cachin, C. (2005). Digital Steganography. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_115
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_115
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering