Public-key steganography with active attacks

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 210-226

  Backes, Michael ^a   Cachin, Christian ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CHOSEN COVERTEXT ATTACKS; PSEUDORANDOM CIPHERTEXTS; PUBLIC-KEY STEGANOGRAPHY; STEGANOGRAPHIC SECURITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 24144456920     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_12     Document Type: Conference Paper

References (24)

1. J. H. An, Y. Dodis, and T. Rabin, "On the security of joint signatures and encryption," in Advances in Cryptology: EUROCRYPT 2002 (L. Knudsen, ed.), vol. 2332 of Lecture Notes in Computer Science, Springer, 2002.
2. R. J. Anderson and F. A. Petitcolas, "On the limits of steganography," IEEE Journal on Selected Areas in Communications, vol. 16, May 1998.
3. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, "Relations among notions of security for public-key encryption schemes," in Advances in Cryptology: CRYPTO '98 (H. Krawczyk, ed.), vol. 1462 of Lecture Notes in Computer Science, Springer, 1998.
4. C. Cachin, "An information-theoretic model for steganography," Information and Computation, vol. 192, pp. 41-56, July 2004. Parts of this paper appeared in Proc. 2nd Workshop on Information Hiding, Springer, 1998.
5. R. Canetti, H. Krawczyk, and J. Nielsen, "Relaxing chosen-ciphertext security," in Advances in Cryptology: CRYPTO 2003 (D. Boneh, ed.), vol. 2729 of Lecture Notes in Computer Science, Springer, 2003.
6. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.
7. R. Cramer and V. Shoup, "A practical public-key cryptosystem provably secure against adaptive chosen-ciphertext attack," in Advances in Cryptology: CRYPTO '98 (H. Krawczyk, ed.), vol. 1462 of Lecture Notes in Computer Science, Springer, 1998.
8. S. Craver, "On public-key steganography in the presence of an active warden," in Information Hiding, 2nd International Workshop (D. Aucsmith, ed.), vol. 1525 of Lecture Notes in Computer Science, pp. 355-368, Springer, 1998.
9. N. Dedić, G. Itkis, L. Reyzin, and S. Russell, "Upper and lower bounds on black-box steganography," in Proc. 2nd Theory of Cryptography Conference (TCC) (J. Kilian, ed.), Lecture Notes in Computer Science, Springer, 2005.
10. D. Dolev, C. Dwork, and M. Naor, "Non-malleable cryptography," SIAM Journal on Computing, vol. 30, no. 2, pp. 391-437, 2000.
11. S. Goldwasser and S. Micali, "Probabilistic encryption," Journal of Computer and System Sciences, vol. 28, pp. 270-299, 1984.
12. N. J. Hopper, J. Langford, and L. von Ahn, "Provably secure steganography," in Advances in Cryptology: CRYPTO 2002 (M. Yung, ed.), vol. 2442 of Lecture Notes in Computer Science, Springer, 2002.
13. Y. Lindell. Personal communication, Jan. 2004.
14. M. Luby, Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
15. T. Mittelholzer, "An information-theoretic approach to steganography and watermarking," in Information Hiding, 3rd International Workshop, IH'99 (A. Pfitzmann, ed.), vol. 1768 of Lecture Notes in Computer Science, pp. 1-16, Springer, 1999.
16. C. Rackoff and D. R. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack," in Advances in Cryptology: CRYPTO '91 (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 433-444, Springer, 1992.
17. L. Reyzin and S. Russell, "Simple stateless steganography." Cryptology ePrintArchive, Report 2003/093, 2003. http://eprint.iacr.org/.
18. A. Sahai, "Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security," in Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 543-553, 1999.
19. V. Shoup, "A proposal for an ISO standard for public key encryption." Cryptology ePrint Archive, Report 2001/112, 2001. http://eprint.iacr.org/.
20. V. Shoup, "OAEP reconsidered," Journal of Cryptology, vol. 15, no. 4, pp. 223-249, 2002.
21. G. J. Simmons, "The prisoners' problem and the subliminal channel," in Advances in Cryptology: Proceedings of Crypto 83 (D. Chaum, ed.), pp. 51-67, Plenum Press, 1984.
22. L. von Ahn and N. J. Hopper, "Public-key steganography," in Advances in Cryptology: Eurocrypt 2004 (C. Cachin and J. Camenisch, eds.), vol. 3027 of Lecture Notes in Computer Science, pp. 322-339, Springer, 2004.
23. M. N. Wegman and J. L. Carter, "New hash functions and their use in authentication and set equality," Journal of Computer and System Sciences, vol. 22, pp. 265-279, 1981.
24. J. Zöllner, H. Federrath, H. Klimant, A. Pfitzmann, R. Piotraschke, A. Westfeld, G. Wicke, and G. Wolf, "Modeling the security of steganographic systems," in Information Hiding, 2nd International Workshop (D. Aucsmith, ed.), vol. 1525 of Lecture Notes in Computer Science, pp. 344-354, Springer, 1998.