On the impossibility of efficiently combining collision resistant hash functions

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

Volumn 4117 LNCS, Issue , 2006, Pages 570-583

  Boneh, Dan ^a   Boyen, Xavier ^b  

^a Stanford University   (United States)

^b Voltage Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FUNCTION EVALUATION; SECURITY OF DATA; THEOREM PROVING;

COLLISION RESISTANT HASH FUNCTIONS; HASH OUTPUT SIZE;

FUNCTIONS;

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

References (23)

1. Charles Asmuth and G. R. Blakely. An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems. Computers and Mathematics with Applications, 7:447-450, 1981.
2. Paulo S. L. M. Barreto and Vincent Rijmen. The Whirlpool hashing function. In First open NESSIE Workshop, Leuven, Belgium, November 2000.
3. John Black, Martin Cochran, and Thomas Shrimpton. On the impossibility of highly efficient blockcipher-based hash functions. In Proceedings of Eurocrypt '05, volume 3494 of LNCS. Springer-Verlag, 2005.
4. John Black, Phillip Rogaway, and Thomas Shrimpton. Black-box analysis of the block-cipher-based hash-function constructions from PGV. In Proceedings of Crypto '02, LNCS. Springer-Verlag, 2002.
5. Jean-Sebastian Coron, Yevgeniy Dodis, Cecile Malinaud, and Prashant Puniya. Merkle-Damgård revisited: how to construct a hash function. In Proceedings of Crypto '05, volume 3621 of LNCS. Springer-Verlag, 2005.
6. Ivan B. Damgård. A design principle for hash functions. In Proceedings of Crypto '89, LNCS. Springer-Verlag, 1989.
7. Yevgeniy Dodis and Jonathan Katz. Chosen ciphertext security of multiple encryption. In Proceedings of TCC '05, pages 188-209, 2005.
8. Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, and Alon Rosen. On robust combiners for oblivious transfer and other primitives. In Proceedings of Eurocrypt '05, pages 96-113, 2005.
9. Amir Herzberg. Tolerant combiners: Resilient cryptographic design. Cryptology ePrint Archive, Report 2002/135, 2002. http://eprint.iacr.org/.
10. Jonathan Hoch and Adi Shamir. Breaking the ICE - finding multicollisions in iterated concatenated and expanded (ICE) hash functions. In Proceedings of FSE '06, 2006.
11. Susan Hohenberger and Anna Lysyanskaya. How to securely outsource cryptographic computations. In Proceedings of TCC '05, pages 264-282, 2005.
12. Antoine Joux. Multicollisions in iterated hash functions, application to cascaded constructions. In Proceedings of Crypto '04, volume 3152 of LNCS, pages 306-316. Springer-Verlag, 2005.
13. John Kelsey. Can we get a reduction proof for truncated hashes? Crypto '05 rump session, 2005.
14. Stefan Lucks. Design principles for iterated hash functions. Cryptology ePrint Archive, Report 2004/253, 2004. http://eprint.iacr.org/.
15. Ralph C. Merkle. One way hash functions and DES. In Proceedings of Crypto '89, LNCS. Springer-Verlag, 1989.
16. Mridul Nandi and Doug R. Stinson. Multicollision attacks on some generalized sequential hash functions. Cryptology ePrint Archive, Report 2006/055, 2006.
17. Moni Naor and Moti Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of STOC'89, pages 33-43, 1989.
18. NIST. Secure hash standard. Federal Information Processing Standards (FIPS) Publication 180-2, 2002.
19. Bart Preneel, René Govaerts, and Joos Vandewalle. Hash functions based on block ciphers: A synthetic approach. In Proceedings of Crypto '93, LNCS. Springer-Verlag, 1993.
20. Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, and Xiuyuan Yu. Cryptanalysis of the hash functions MD4 and RIPEMD. In Proceedings of Eurocrypt '05, volume 3494 of LNCS, pages 1-18. Springer-Verlag, 2005.
21. Xiaoyun Wang, Andrew Yao, and Frances Yao. New collision search for SHA-1. Rump Session Crypto'04, 2004.
22. Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu. Finding collisions in the full SHA-1. In Proceedings of Crypto '05, volume 3621 of LNCS. Springer-Verlag, 2005.
23. Xiaoyun Wang and Hongbo Yu. How to break MD5 and other hash functions. In Proceedings of Eurocrypt '05, volume 3494 of LNCS, pages 19-35. Springer-Verlag, 2005.