Non-trivial black-box combiners for collision-resistant hash-functions don't exist

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

Volumn 4515 LNCS, Issue , 2007, Pages 23-33

  Pietrzak, Krzysztof ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION AVOIDANCE; COMPUTATIONAL METHODS; FORMAL METHODS; FUNCTION EVALUATION;

BLACK BOX COMBINERS; COLLISION RESISTANT HASH FUNCTIONS; HASH FUNCTIONS;

CRYPTOGRAPHY;

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

References (19)

1. C. A. Asmuth and G. R. Blakley. An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems. Computers and Mathematics with Applications, pages 447-450, 1981.
2. Dan Boneh and Xavier Boyen. On the impossibility of efficiently combining collision resistant hash functions. In CRYPTO, 2006.
3. Scott Contini, Arjen K. Lenstra, and Ron Steinfeld. Vsh, an efficient and provable collision-resistant hash function. In EUROCRYPT, pages 165-182, 2006.
4. Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, and Prashant Puniya. Merkle-damgård revisited : How to construct a hash function. In Advances in Cryptology - CRYPTO '05, volume 3621 of Lecture Notes in Computer Science, pages 430-448, 2005.
5. Yevgeniy Dodis and Jonathan Katz. Chosen-ciphertext security of multiple encryption. In TCC, pages 188-209, 2005.
6. Shimon Even and Oded Goldreich. On the power of cascade ciphers. ACM Trans. Comput. Syst., 3(2):108-116, 1985.
7. Danny Harnik, Joe Kilian, Moni Naor, Orner Reingold, and Alon Rosen. On robust combiners for oblivious transfer and other primitives. In EUROCRYPT, pages 96-113, 2005.
8. Amir Herzberg. On tolerant cryptographic constructions. In CT-RSA, pages 172-190, 2005.
9. Antoine Joux. Multicollisions in iterated hash functions. application to cascaded constructions. In CRYPTO, pages 306-316, 2004.
10. Jonathan Katz and Chiu-Yuen Koo. On constructing universal one-way hash functions from arbitrary one-way functions, 2005. Cryptology ePrint Archive: Report 2005/328.
11. Ueli M. Maurer and James L. Massey. Cascade ciphers: The importance of being first. J. Cryptology, 6(1):55-61, 1993.
12. Remo Meier and Bartosz Przydatek. On robust combiners for private information retrieval and other primitives. In Cynthia Dwork, editor, CRYPTO '06, volume 4117 of Lecture Notes in Computer Science, pages 555-569, 2006.
13. Remo Meier, Bartosz Przydatek, and Jürg Wullschleger. Robuster combiners for oblivious transfer. In TCC 2007, volume 4392 of Lecture Notes in Computer Science, pages 404-418, 2007.
14. Moni Naor and Moti Yung. Universal one-way hash functions and their cryptographic applications. In STOC, pages 33-43, 1989.
15. Phillip Rogaway. Formalizing human ignorance: Collision-resistant hashing without the keys, 2006. Cryptology ePrint Archive: Report 2006/281.
16. John Rompel. One-way functions are necessary and sufficient for secure signatures. In STOC, pages 387-394, 1990.
17. Daniel R. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In EUROCRYPT, pages 334-345, 1998.
18. Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu. Finding collisions in the full sha-1. In CRYPTO, pages 17-36, 2005.
19. Xiaoyun Wang and Hongbo Yu. How to break md5 and other hash functions. In EUROCRYPT, pages 19-35, 2005.