A Collision-Resistant Rate-1 Double-Block-Length Hash Function

Dagstuhl Seminar Proceedings

Volumn 7021, Issue , 2007, Pages

  Lucks, Stefan ^a,b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b BAUHAUS UNIVERSITY WEIMAR   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION;

BLOCK CIPHERS; BUILDING BLOCKES; CRYPTOGRAPHICS; DOUBLE-BLOCK-LENGTH HASH FUNCTIONS; IDEAL-CIPHER MODEL; MESSAGE AUTHENTICATION; UNIVERSAL HASHING;

HASH FUNCTIONS;

EID: 84871603203     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. D. Bernstein. The polyl305-AES message-authentication code. FSE 2005.
2. M. Bellare, T. Ristenpart. Multi-property-preserving hash domain extension: The EMD transform. Asiacrypt 2006.
3. E. Biham, R. Chen, A. Joux, P. Carribault, C. Lemuet, W. Jalby. Collisions of SHA-0 and reduced SHA-1. Eurocrypt 2005.
4. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway. UMAC: fast and secure message authentication. Crypto’99.
5. J. Black, P. Rogaway, T. Shrimpton. Black-box analysis of the block-cipher based hash-function construction from PGV. Crypto 02.
6. J. Black. The ideal-cipher model, revisited: An uninstantiable blockcipher-based hash function. FSE 2006.
7. M. Boesgaard, T. Christensen, E. Zenner. Badger – a fast and provably secure MAC. Applied Cryptography and Network Security, ACNS 2005.
8. J. Coron, Y. Dodis, C. Malinaud, P. Punyia. Merkle-Damgård revisited: how to construct a hash function. Crypto 2005.
9. I. Damgård. A design principle for hash functions. Crypto 89.
10. M. Etzel, S. Patel, Z. Ramzan. Square hash: fast message authentication via optimized universal hash functions. Crypto’99.
11. S. Hirose. Some Plausible Constructions of Double-Block-Length Hash Functions. FSE 2006.
12. A. Joux. Multicollisions in iterated hash functions, application to cascaded constructions. Crypto 04.
13. J. Kelsey, T. Kohno. Herding Hash Functions and the Nostradamus Attack. Eurocrypt 2006.
14. n work. Eurocrypt 2005.
15. T. Kohno, J. Viega, D. Whiting. CWC: a high performance conventional authenticared encryption mode. FSE 04.
16. M. Liskov. Constructing an Ideal Hash Function from Weak Ideal Compression Functions. SAC 2006.
17. S. Lucks. A Failure-Friendly Design Principle for Hash Functions. Asiacrypt 2005.
18. S. Lucks. Faster Luby-Rackoff Ciphers. FSE 1996.
19. A. Menezes, P. van Oorschot, S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
20. R. Merkle. One-way hash functions and DES. Crypto 89.
21. M. Naor, O. Reingold. On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptology 12(1) 29-66 (1999).
22. B. Preneel, R. Govaerts, R. Vanderwalle. Hash functions based on block ciphers: A syntetic approach. Crypto 93.
23. P. Rogaway. Formalizing Human Ignorance: Collision-Resistant Hashing without the Keys. http://eprint.iacr.org/2006/281. (Also in Vietcrypt 2006.)
24. P. Rogaway and T. Shrimpton. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision-Resistance. FSE 2004.
25. X. Wang, X. Lai, D. Feng, H. Cheng, X. Yu. Cryptoanalyisis of the hash functions MD4 and RIPEMD. Eurocrypt 2005.
26. X. Wang, H. Yu. How to break MD5 and other hash functions. Eurocrypt 2005.
27. X. Wang, H. Yu, Y. L. Yin. Efficient collision search attacks on SHA0. Crypto 2005.
28. X. Wang, Y. L. Yin, H. Yu. Finding collisions in the full SHA1. Crypto 2005.
29. M. Wegman, J. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, Vol. 22, 1981, 265–279.