A fast and key-efficient reduction of chosen-ciphertext to known-plaintext security

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

Volumn 4515 LNCS, Issue , 2007, Pages 498-516

  Maurer, Ueli ^a   Sjödin, Johan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CODES (SYMBOLS); COMPUTATIONAL EFFICIENCY; INTRUSION DETECTION; RANDOM PROCESSES;

AUTHENTICATION SCHEMES; CIPHERTEXT ATTACKS; PSEUDORANDOM FUNCTION;

CRYPTOGRAPHY;

EID: 38049177352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_29     Document Type: Conference Paper

References (25)

1. W. Aiello, S. Rajagopalan, and R. Venkatesan. High-speed pseudorandom number generation with small memory. In Fast Software Encryption, volume 1636 of LNCS, pages 290-304. Springer, 1999.
2. F. Bao, R. H. Deng, and H. Zhu. Variations of Diffie-Hellman problem. In ICICS '03, volume 2836 of LNCS, pages 301-312. Springer, 2003.
3. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A concrete security treatment of symmetric encryption. In Proc. of the 38th Symposium on Foundations of Computer Science, pages 394-403. IEEE, 1997.
4. M. Bellare, J. Kilian, and P. Rogaway. The security of cipher block chaining. In Advances in Cryptology - CRYPTO '94, volume 839 of LNCS, pages 341-358. Springer, 1994.
5. M. Bellare and C Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In Advances in Cryptology - ASIACRYPT '00, volume 1976 of LNCS, pages 531-545. Springer, 2000.
6. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. Umac: Fast and secure message authentication. In Advances in Cryptology - CRYPTO '99, volume 1666 of LNCS, pages 313-328. Springer, 1999.
7. A. Blum, M. L. Furst, M. J. Kearns, and R. J. Lipton. Cryptographic primitives based on hard learning problems. In Advances in Cryptology - CRYPTO '93, volume 773 of LNCS, pages 278-291. Springer, 1993.
8. I. Damgård and J. B. Nielsen. Expanding pseudorandom functions; or: From known-plaintext security to chosen-plaintext security. In Advances in Cryptology - CRYPTO '02, volume 2442 of LNCS, pages 449-464. Springer, 2002.
9. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, 1976.
10. O. Goldreich. Foundations of Cryptography - Volume II - Basic Applications. Cambridge University Press, 2004.
11. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33(4):792-807, 1986.
12. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
13. J. Katz and M. Yung. Complete characterization of security notions for probabilistic private-key encryption. In Proc. of the 32nd Annual Symposium on Theory of Computing, pages 245-254. ACM, 2000.
14. M. Keller. Constructing weak pseudorandom functions with prescribed structure, 2006. Semester Thesis, ETH Zurich.
15. S. Kent and R. Atkinson. IP encapsulating security payload (ESP), November 1998. Request for Comments 2406.
16. K. Minematsu and Y. Tsunoo. Expanding weak PRF with small key size. In ICISC '05, volume 3935 of LNCS, pages 284-298. Springer, 2005.
17. M. Naor, B. Pinkas, and O. Reingold. Distributed pseudo-random functions and KDCs. In Advances in Cryptology - EUROCRYPT '99, volume 1592 of LNCS, pages 327-346. Springer, 1999.
18. M. Naor and O. Reingold. From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. In Advances in Cryptology - CRYPTO '98, LNCS, pages 267-282. Springer, 1998.
19. M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comp. Sys. Sci., 58(2):336-375, 1999.
20. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudorandom functions. J. of the ACM, 51(2):231-262, 2004.
21. K. Pietrzak and J. Sjödin. Weak pseudorandom functions in minicrypt, November 2006. Manuscript.
22. K. Pietrzak and J. Sjödin. Domain extension for weak PRFs; the good, the bad, and the ugly. In Advances in Cryptology - EUROCRYPT '07, LNCS. Springer, 2007. This proceedings.
23. V. Shoup. On fast and provably secure message authentication based on universal hashing. In Advances in Cryptology - CRYPTO '96, volume 1109 of LNCS, pages 313-328. Springer, 1996.
24. D. R. Stinson. Universal hashing and authentication codes. In Advances in Cryptology - CRYPTO '91, volume 576 of LNCS, pages 74-85. Springer, 1992.
25. M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. J. Comp. Sys. Sci., 22:265-279, 1981.