Public-key steganography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3027, Issue , 2004, Pages 323-341

  Von Ahn, Luis ^a   Hopper, Nicholas J ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; INFORMATION THEORY;

COMPUTATIONAL SECURITY; CRYPTOGRAPHIC ASSUMPTIONS; HIDDEN MESSAGES; KEY EXCHANGE; PROVABLE SECURITY; PROVABLY SECURE; PUBLIC KEY STEGANOGRAPHY; RANDOM ORACLE MODEL;

STEGANOGRAPHY;

EID: 33750401431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_20     Document Type: Article

References (14)

1. R. J. Andersen and F. A. P. Petitcolas. On The Limits of Steganography. IEEE Journal of Selected Areas in Communications, 16(4), pages 474-481, 1998.
2. M. Backes and G. Cachin. Public-Key Steganography with Active Attacks. Cryptology ePrint Archive, Report 2003/231, November 6, 2003. Available electronically: http ://eprint.iacr.org/2003/231.
3. M. Bellare and P. Rogaway. Random Oracles are Practical. Computer and Communications Security: Proceedings of ACM CCS 93, pages 62-73, 1993.
4. C. Cachin. An Information-Theoretic Model for Steganography. Proceedings of Second International Information Hiding Workshop, Springer LNCS 1525, pages 306-318, 1998.
5. S. Craver. On Public-key Steganography in the Presence of an Active Warden. Proceedings of Second International Information Hiding Workshop, Springer LNCS 1525, pages 355-368, 1998.
6. J. Hastad, R. Impagliazzo, L. Levin, and M. Luby. A Pseudorandom generator from any one-way function. SI AM Journal of Computing, 28 (4), pages 1364-1396, 1999.
7. N. J. Hopper, J. Langford, and L. Von Ahn. Provably Secure Steganography. Advances in Cryptology: CRYPTO 2002, Springer LNCS 2442, pages 77-92, 2002.
8. T. Mittelholzer. An Information-Theoretic Approach to Steganography and Watermarking. Proceedings of the Third International Information Hiding Workshop, Springer LNCS 1768, pages 1-16, 2000.
9. J. A. O'Sullivan, P. Moulin, and J. M. Ettinger. Information-theoretic analysis of Steganography. Proceedings ISIT 98, 1998.
10. C. Rackoff and D. Simon. Non-interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. Advances in Cryptology: CRYPTO 91, Springer LNCS 576, pages 433-444, 1992.
11. G. J. Simmons. The Prisoner's Problem and the Subliminal Channel. Advances in Cryptology: CRYPTO 83, pages 51-67, 1983.
12. T. Van Le. Efficient Proven Secure Public Key Steganography. Cryptology ePrint Archive, Report 2003/156, September 3, 2003. Available electronically: http://eprint.iacr.org/2003/156.
13. A. Young and M. Yung. Kleptography: Using Cryptography against Cryptography. Advances in Cryptology: Eurocrypt 97, Springer LNCS 1233, pages 62-74, 1997.
14. J. Zollner, H. Federrath, H. Klimant, A. Pftizmann, R. Piotraschke, A. Westfield, G. Wicke, G. Wolf. Modeling the security of steganographic systems. Proceedings of the Second International Information Hiding Workshop, Springer LNCS 1525, pages 344-354, 1998.