Merkle-damgård revisited: How to construct a hash function

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

Volumn 3621 LNCS, Issue , 2006, Pages 430-448

  Coron, Jean Sébastien ^a   Dodis, Yevgeniy ^b   Malinaud, Cécile ^c   Puniya, Prashant ^b  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b NEW YORK UNIVERSITY   (United States)

^c GEMPLUS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY LENGTH; HASH FUNCTION; RANDOM ORACLE; SECURITY NOTION;

COLLISION AVOIDANCE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; CRYPTOGRAPHY; MATHEMATICAL TRANSFORMATIONS; SECURITY OF DATA; THEOREM PROVING;

DATA COMPRESSION;

EID: 33745119040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (31)

1. J. H. An, M. Bellare, Constructing- VIL-MACs from FIL-MACs: Message Authentication under Weakened Assumptions, CRYPTO 1999, pages 252-269.
2. Mihir Bellare, Alexandra Boldyreva and Adriana Palacio. An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. Proceedings of Eurocrypt 2004.
3. M. Bellare, J. Kilian, and P. Rogaway. The Security of Cipher Block Chaining. In Crypto '94, pages 341-358, 1994. LNCS No. 839.
4. M. Bellare and P. Rogaway, Random oracles are practical : a paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Commmunications Security, ACM, 1993.
5. M. Bellare and P. Rogaway, The exact security of digital signatures - How to sign with RSA and Rabin. Proceedings of Eurocrypt'96, LNCS vol. 1070, Springer-Verlag, 1996, pp. 399-416.
6. M. Bellare and P. Rogaway, Optimal Asymmetric Encryption, Proceedings of Eurocrypt'94, LNCS vol. 950, Springer-Verlag, 1994, pp. 92-111.
7. M. Bellare and P. Rogaway, Collision-Resistant Hashing: Towards Making UOWHFs Practical, In Crypto :97, LNCS Vol. 1294.
8. M. Bellare, R. Canetti, and H. Krawczyk, Pseudorandom Functions Re-visited: The Cascade Construction and Its Concrete Security, In Proc. 37th FOCS, pages 514-523. IEEE, 1996.
9. J. Black, P. Rogaway, T. Shrimpton, Biack-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV, in Advances in Cryptology - CRYPTO 2002, California, USA.
10. R. Canetti, Universally Composable Security: A New Paradigm for Crypto-graphic Protocols, proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS), 2001. Cryptology ePrint Archive, Report 2000/067, http://sprint.iacr.org/.
11. R. Canetti, O. Goldreich and S. Halevi, The random oracie methodology, revisited, STOC' 98, ACM, 1998.
12. Ran Canetti, Oded Goldreich and Shai Halevi. On the random oracle methodology as applied to Length-Restricted Signature Schemes. In Proceedings of Theory of Cryptology Conference, pp. 40-57, 2004.
13. I. Damgård, A Design Principle for Hash Functions, In Crypto '89, pages 416-427, 1989. LNCS No. 435.
14. 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, August 2004.
15. Y. Dodis, R. Oliveira, K. Pietrzak, On the Generic Insecurity of the Full Domain Hash, Advances in Cryptology - CRYPTO, August 2005.
16. FIPS 180-1, Secure hash standard, Federal Information Processing Standards Publication 180-1, U.S. Department of Commerce/N.I.S.T., National Technical Information Service, Springfield, Virginia, April 17 1995 (supersedes FIPS PUB 180).
17. National Institute of Standards and Technology (NIST). Secure hash standard. FIPS 180-2. August 2002.
18. RFC 1321, The MD5 message-digest algorithm, Internet Request for Comments 1321, R.L. Rivest, April 1992.
19. Shafi Goldwasser and Yael Tauman. On the (In)security of the Fiat-Shamir Paradigm. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003), 102-114.
20. H. Handschuh and D. Naccache, SHACAL, In B. Preneel, Ed., First Open NESSIE Workshop, Leuven, Belgium, November 13-14, 2000
21. M. Luby and C. Rackoff, How to construct pseudo-random permutations from pseudo-random functions, SIAM J. Comput., Vol. 17, No. 2, April 1988.
22. Stefan Lucks. Design Principles for Iterated Hash Functions, available at E-Print Archive, http://eprint.iacr.org/2004/253.
23. U. Maurer, R. Renner, and G. Holenstein, Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology, Theory of Cryptography - TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 21-39, Feb 2004.
24. Ueli Maurer and Johan Sjodin. Single-key AIL-MACs from any FIL-MAC, In ICALP 2005, July 2005.
25. R. Merkle, One way hash functions and DES, Advances in Cryptology, Proc. Crypto'89, LNCS 435, G. Brassard, Ed., Springer-Verlag, 1990, pp. 428-446.
26. Jesper Buus Nielsen. Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-Committing Encryption Case. In Advances in Cryptology - Crypto 2002 Proceedings (2002), 111-126
27. PKCS #1 v2.1, RSA Cryptography Standard (draft), document available at www.rsasecurity.com/rsalabs/pkcs.
28. B. Pfitzmann and M. Waidner, A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Security and Privacy, pages 184-200. IEEE Computer Society Press, 2001.
29. B. Preneel, R. Govaerts and J. Vandewalle, Hash Functions Based on Block Ciphers: A Synthetic Approach, in Advances in Cryptology - CRYPTO '93, Santa Barbara, California, USA.
30. V. Shoup, A composition theorem for universal one-way hash functions, In Euro-crypt '00, pp. 445-452, LNCS Vol. 1807.
31. R. Winternitz, A secure one-way hash function built from DES, in Proceedings of the IEEE Symposium on Information Security and Privacy, pages 88-90. IEEE Press, 1984.