Abstract
The so-called prisoners’ problem, in which two individuals attempt to communicate covertly without alerting a “warden” who controls the communications channel, has taken a number of forms, adorned with various assumptions or requirements which make the problem more or less difficult. One assumption which makes the problem considerably more managable is that the participants are allowed to share some secret information (such as an encryption key) prior to imprisonment. Another assumption, which makes the problem much more difficult, is that the warden be allowed to modify messages sent between the prisoners as well as read them. This paper describes techniques for pure steganography, in which no secret information needs to be shared before imprisonment. First, a modification of an existing protocol will be shown to admit pure steganography if the warden is not allowed to modify the contents of the channel. Then, a technique will be described that allows pure steganography between two prisoners in the presence in the presence of an active (content-modifying) warden.
This technique is possible through the use of two distinct channels rather than one: the subliminal channel for steganographic communication is augmented by a supraliminal channel, one in which information is not hidden from the warden but cannot be modified.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R.J. Anderson. Stretching the limits of steganography:. In Information Hiding, volume Springer Lecture Notes in Computer Science v 1174, pages 39–48, May 1996.
Ross J. Anderson, editor. Information hiding: first international workshop, volume 1174 of Lecture Notes in Computer Science, Isaac Newton Institute, Cambridge, UK, May 1996. Springer-Verlag, Berlin, Germany.
I.J. Cox, J. Kilian, T. Leighton, and T. Shamoon. Secure spread spectrum water-marking for multimedia. Technical Report Technical Report 95-10, NEC Research Institute, 1995.
S. Craver, N. Memon, B.L. Yeo, and M.M. Yeung. On the invertibility of invisible watermarking techniques. submitted to International Conference on Image Processing 1997, 1997.
David Kahn. The history of steganography. In Anderson [2], pages 1–5.
Birgit Pfitzmann. Information hiding terminology. In Anderson [2], pages 347–350.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Craver, S. (1998). On Public-Key Steganography in the Presence of an Active Warden. In: Aucsmith, D. (eds) Information Hiding. IH 1998. Lecture Notes in Computer Science, vol 1525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49380-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-49380-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65386-8
Online ISBN: 978-3-540-49380-8
eBook Packages: Springer Book Archive