Abstract
We present a number of insights into information hiding. It was widely believed that public key steganography was impossible; we show how to do it. We then look at a number of possible approaches to the theoretical security of hidden communications. This turns out to hinge on the inefficiency of practical compression algorithms, and one of the most important parameters is whether the opponent is active or passive (i.e., whether the censor can add noise, or will merely allow or disallow a whole messages). However, there are covertexts whose compression characteristics are such that even an active opponent cannot always eliminate hidden channels completely.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
“The Newton Channel”, RJ Anderson, S Vaudenay, B Preneel, K Nyberg, this volume
“Tamper Resistant Software: An Implementation”, D Aucsmith, this volume
“Watermarking Digital Images for Copyright Protection”, FM Boland, JJK Ó Ruanaidh, C Dautzenberg, Proceedings, IEE International Conference on Image Processing and its Applications, Edinburgh 1995
“Computer Based Steganography”, E Franz, A Jerichow, S Moeller, A Pfitzmann, I Stierand, this volume
“A voluntary international numbering system — the latest WIPO proposals”, R Hart, Computer Law and Security Report v 11 no 3 (May–June 95) pp 127–129
Talk on software birthmarks, counsel for IBM Corporation, BCS Technology of Software Protection Special Interest Group, London 1985
'Steganography in Digital Images', G Jagpal, Thesis, Cambridge University Computer Laboratory, May 1995
'The Codebreakers', D Kahn, Macmillan 1967
“Towards Robust and Hidden Image Copyright Labeling”, E Koch, J Zhao, Proceedings of 1995 IEEE Workshop on Nonlinear Signal and Image Processing (Neos Marmaras, Halkidiki, Greece, June 20–22, 1995)
“Electronic Document Distribution”, NF Maxemchuk, AT & T Technical Journal v 73 no 5 (Sep/Oct 94) pp 73–80
“Covert Channels — Here to Stay?”, IS Moskowitz, MH Kang, Compass 94 pp 235–243
RM Needham, private conversation, December 1995
'Applied Cryptography — Protocols, Algorithms and Source Code in C'’ B Schneier (second edition), Wiley 1995
“A Mathematical Theory of Communication”, CE Shannon, in Bell Systems Technical Journal v 27 (1948) pp 379–423, 623–656
“Communication theory of secrecy systems”, CE Shannon, in Bell Systems Technical Journal v 28 (1949) pp 656–715
“The Prisoners' Problem and the Subliminal Channel”, GJ Simmons, in Proceedings of CRYPTO '83, Plenum Press (1984) pp 51–67
“How to Insure that Data Acquired to Verify Treaty Compliance are Trustworthy”, GJ Simmons, Proceedings of the IEEE v 76 (1984) p 5
“A survey of information authentication”, GJ Simmons, in Contemporary Cryptology — the Science of information Integrity, IEEE Press 1992, pp 379–419
“The History of Subliminal Channels”, GJ Simmons, this volume
'High Quality De-interlacing of Television Images', N van Someren, PhD Thesis, University of Cambridge, September 1994
K Spärck Jones, private communication, August 1995
“Modelling a Fuzzy Time System”, JT Trostle, Proc. IEEE Symposium in Security and Privacy 93 pp 82–89
“Embedding Robust Labels Into Images For Copyright Protection”, J Zhao, E Koch, Proc. Int. Congr. on IPR for Specialized Information, Knowledge and New Technologies (Vienna, Austria, August 21–25, 1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, R. (1996). Stretching the limits of steganography. In: Anderson, R. (eds) Information Hiding. IH 1996. Lecture Notes in Computer Science, vol 1174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61996-8_30
Download citation
DOI: https://doi.org/10.1007/3-540-61996-8_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61996-3
Online ISBN: 978-3-540-49589-5
eBook Packages: Springer Book Archive