New proofs for NMAC and HMAC: Security without collision-resistance

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

Volumn 4117 LNCS, Issue , 2006, Pages 602-619

  Bellare, Mihir ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; NETWORK PROTOCOLS; SECURITY OF DATA; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

COLLISION RESISTANCE; COMPRESSION FUNCTION; HASH FUNCTIONS;

FUNCTIONS;

EID: 33749544409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_36     Document Type: Conference Paper

References (34)

1. American National Standards Institution. ANSI X9.71, Keyed hash message authentication code, 2000.
2. M. Bellare. New Proofs for NMAC and HMAC: Security without Collision-Resistance. Full version of this paper. Cryptology ePrint Archive: Report 2006/043, 2006.
3. M. Bellare, R. Canetti and H. Krawczyk. Keying hash functions for message authentication. Advances in Cryptology - CRYPTO'96, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996.
4. M. Bellare, R. Canetti and H. Krawczyk. Pseudorandom functions revisited: The cascade construction and its concrete security, http://www-cse.ucsd.edu/ users/mihir. (Preliminary version in Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996.)
5. M. Bellare, A. Desai, E. Jokipii and P. Rogaway. A concrete security treatment of symmetric encryption. Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
6. M. Bellare, J. Kilian and P. Rogaway. The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences, Vol. 61, No. 3, Dec 2000, pp. 362-399.
7. M. Bellare and T. Kohno. A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications. Advances in Cryptology - EUROCRYPT '03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003.
8. M. Bellare, C. Namprempre and T. Kohno. Authenticated Encryption in SSH: Provably Fixing the SSH Binary Packet Protocol. ACM Transactions on Information and System Security (TISSEC), Vol. 7, Iss. 2, May 2004, pp. 206-241.
9. M. Bellare, O. Goldreich and A. Mityagin. The power of verification queries in message authentication and authenticated encryption. Cryptology ePrint Archive: Report 2004/309, 2004.
10. M. Bellare and P. Rogaway. The game-playing technique and its application to triple encryption. Cryptology ePrint Archive: Report 2004/331, 2004.
11. J. BLACK, S. HALEVI, H. KRAWCZYK, T. KROVETZ AND P. ROGAWAY. UMAC: Fast and Secure Message Authentication. Advances in Cryptology -CRYPTO'99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999.
12. J. Black and P. Rogaway. CBC MACs for arbitrary-length messages: The three-key constructions. Advances in Cryptology - CRYPTO'00, Lecture Notes in Computer Science Vol. 1880, M. Bellare ed., Springer-Verlag, 2000.
13. L. CARTER AND M. WEGMAN. Universal classes of hash functions. Journal of Computer and System Sciences, Vol. 18, No. 2, 1979, pp. 143-154.
14. I. Damgård. A design principle for hash functions. Advances in Cryptology -CRYPTO'89, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
15. B. den Boer and A. Bosselaers. Collisions for the compression function of MD5. Advances in Cryptology - EUROCRYPT'93, Lecture Notes in Computer Science Vol. 765, T. Helleseth ed., Springer-Verlag, 1993.
16. T. Dierks and C. Allen. The TLS protocol. Internet RFC 2246, 1999.
17. H. Dobbertin, A. Bosselaers and B. Preneel. RIPEMD-160: A strengthened version of RIPEMD. Fast Software Encryption'96, Lecture Notes in Computer Science Vol. 1039, D. Gollmann ed., Springer-Verlag, 1996.
18. Y. Dodis, R. Gennaro, J. Håstad, H. Krawczyk, and T. Rabin. Randomness extraction and key derivation using the CBC, Cascade, and HMAC modes. Advances in Cryptology - CRYPTO '04, Lecture Notes in Computer Science Vol. 3152, M. Franklin ed., Springer-Verlag, 2004.
19. O. GOLDREICH, S. GOLDWASSER AND S. MICALI. How to construct random functions. Journal of the ACM, Vol. 33, No. 4, 1986, pp. 210-217.
20. D. Harkins and D. Carrel. The Internet Key Exchange (IKE). Internet RFC 2409, 1998.
21. S. Hirose. A note on the strength of weak collision resistance. IEICE Transactions on Fundamentals, Vol. E87-A, No. 5, May 2004, pp. 1092-1097.
22. H. Krawczyk, M. Bellare and R. Canetti. HMAC: Keyed-hashing for message authentication. Internet RFC 2104, 1997.
23. R. Merkle. One-way hash functions and DES. Advances in Cryptology - CRYPTO '89, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
24. D. M'Raihi, M. Bellare, F. Hoornaert, D. Naccache, O. Ranen. HOTP: An HMAC-based one time password algorithm. Internet RFC 4226, December 2005.
25. National Institute of Standards and Technology. The keyed-hash message authentication code (HMAC). FIPS PUB 198, March 2002.
26. National Institute of Standards and Technology. Secure hash standard. FIPS PUB 180-2, August 2000.
27. B. Preneel and P. van Oorschot. On the security of iterated message authentication codes. IEEE Transactions on Information Theory, Vol. 45, No. 1, January 1999, pp. 188-199.
28. (Preliminary version, entitled "MD-x MAC and building fast MACs from hash functions," in CRYPTO 95.)
29. R. RIVEST. The MD5 message-digest algorithm. Internet RFC 1321, April 1992.
30. V. Shoup. Sequences of games: A tool for taming complexity in security proofs. Cryptology ePrint Archive: Report 2004/332, 2004.
31. D. Stinson. Universal hashing and authentication codes. Designs, Codes and Cryptography, Vol. 4, 1994, 369-380.
32. X. Wang, Y. L. Yin and H. Yu. Finding collisions in the full SHA-1. Advances in Cryptology - CRYPTO'05, Lecture Notes in Computer Science Vol. 3621, V. Shoup ed., Springer-Verlag, 2005.
33. X. Wang and H. Yu. How to break MD5 and other hash functions. Advances in Cryptology - EUROCRYPT '05, Lecture Notes in Computer Science Vol. 3494, R. Cramer ed., Springer-Verlag, 2005.
34. M. WEGMAN AND L. CARTER. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, Vol. 22, No. 3, 1981, pp. 265-279.