Provably Secure Steganography
作者： Nicholas J Hopper , John Langford , Luis Von Ahn
关键词: Steganography 、 Computational indistinguishability 、 Alice (programming language) 、 Computer security 、 Computer science 、 Theoretical computer science
摘要: Abstract: "Informally, steganography is the process of sending a secret message from Alice to Bob in such a way that an eavesdropper (who listens to all communications) cannot even tell that a secret message is being sent. In this work, we initiate the study of steganography from a complexity-theoretic point of view. We introduce definitions based on computational indistinguishability and we prove that the existence of one-way functions implies the existence of secure steganographic protocols."
springer.com
core.ac.uk
springerlink.com参考文章(19)
Russell Impagliazzo, Michael Luby, One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) foundations of computer science. pp. 230- 235 ,(1989)
Scott Craver, On Public-Key Steganography in the Presence of an Active Warden information hiding. pp. 355- 368 ,(1998) , 10.1007/3-540-49380-8_25
Christian Cachin, None, An Information-Theoretic Model for Steganography information hiding. pp. 306- 318 ,(1998) , 10.1007/3-540-49380-8_21
J.A. O'Sullivan, P. Moulin, J.M. Ettinger, Information theoretic analysis of steganography international symposium on information theory. pp. 297- ,(1998) , 10.1109/ISIT.1998.708902
J. Zöllner, H. Federrath, H. Klimant, A. Pfitzmann, R. Piotraschke, A. Westfeld, G. Wicke, G. Wolf, Modeling the Security of Steganographic Systems information hiding. pp. 344- 354 ,(1998) , 10.1007/3-540-49380-8_24
Mihir Bellare, Chanathip Namprempre, Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm international conference on the theory and application of cryptology and information security. pp. 531- 545 ,(2000) , 10.1007/3-540-44448-3_41
Andreas Westfeld, Gritta Wolf, Steganography in a Video Conferencing System information hiding. pp. 32- 47 ,(1998) , 10.1007/3-540-49380-8_3
Gustavus J. Simmons, The Prisoners’ Problem and the Subliminal Channel international cryptology conference. pp. 51- 67 ,(1984) , 10.1007/978-1-4684-4730-9_5
R. Impagliazzo, M. Luby, One-way functions are essential for complexity based cryptography foundations of computer science. pp. 230- 235 ,(1989) , 10.1109/SFCS.1989.63483
Alan L. Mackay, The Code Breakers The Sciences. ,vol. 24, pp. 13- 14 ,(1984) , 10.1002/J.2326-1951.1984.TB02705.X