Sufficient conditions for collision-resistant hashing

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 445-456

  Ishai, Yuval ^a   Kushilevitz, Eyal ^a   Ostrovsky, Rafail ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of California   (United States)

Author keywords

Collision resistant hash functions; Homomorphic encryption; Private information retrieval

Indexed keywords

INFORMATION RETRIEVAL; NETWORK PROTOCOLS;

COLLISION-RESISTANT HASH-FUNCTIONS; HASHING; HOMOMORPHIC-ENCRYPTIONS; PRIVATE INFORMATION RETRIEVAL (PIR);

CRYPTOGRAPHY;

EID: 24144497043     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_24     Document Type: Conference Paper

References (22)

1. B. Barak. How to Go Beyond the Black-Box Simulation Barrier. Proc. of 42nd FOCS, pp. 106-115, 2001.
2. B. Barak, and O. Goldreich. Universal Arguments and their Applications. Proc. of 17th Conference on Computational Complexity, pp. 194-203, 2002.
3. A. Beimel, Y. Ishai, E. Kushilevitz, and T. Malkin. One-Way Functions Are Essential for Single-Server Private Information Retrieval. Proc. of 31st STOC, pp. 89-98, 1999.
4. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. Proc. of IACR EUROCRYPT, LNCS 1592, pp. 402-414, 1999.
5. I. Damgård: Collision Free Hash Functions and Public Key Signature Schemes. In Proc. of EUROCRYPT, pages 203-216, 1987.
6. I. Damgard, T. P. Pedersen and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In Proc. of IACR Crypto, LNCS 773, pp. 250-265, 1993.
7. M. Fischlin. On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function. Proc. of CT-RSA, pp. 79-95, 2002.
8. O. Goldreich. Foundations of Cryptography. Volume I: Basic Tools. Cambridge University Press, 2001.
9. O. Goldreich. Foundations of Cryptography. Volume II: Basic Applications. Cambridge University Press, 2004.
10. O. Goldreich, S. Goldwasser, and S. Halevi. Collision-Free Hashing from Lattice Problems. ECCC TR-42, 1996.
11. S. Goldwasser, and S. Micali. Probabilistic Encryption. Journal of Computer and systems sciences 28, 270-299, 1984.
12. S. Halevi, and S. Micali, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. In Proc. of IACR Crypto, LNCS 1109, pp. 201-215, 1996.
13. C.Y. Hsiao and L. Reyzin. Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? In Proc. of IACR Crypto, 2004.
14. J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments. Proc. of 24th STOC, pp. 723-732, 1992.
15. E. Kushilevitz and R. Ostrovsky. Replication is Not Needed: Single Database, Computationally-Private Information Retrieval. In Proc. of 38th FOCS, pages 364-373, 1997.
16. E. Mann. Private access to distributed information. Master's thesis, Technion - Israel Institute of Technology, Haifa, 1998.
17. S. Micali. CS Proofs. SIAM J. Computing, Vol. 30(4), pp. 1253-1298, 2000. (Early version appeared in FOCS 1994.)
18. W. Ogata, and K. Kurosawa. On Claw Free Families. IEICE Trans., Vol.E77-A(1), pp. 72-80, 1994. (Early version appeared in AsiaCrypt'91.)
19. A. Russell. Necessary and Sufficient Conditions for Collision-Free Hashing. J. Cryptology, Vol. 8(2), pages 87-100, 1995. (Early version in CRYPTO92).
20. D. Simon. Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In Proc. of EUROCRYPT, pages 334-345, 1998.
21. J. P. Stern. A new and efficient all-or-nothing disclosure of secrets protocol. In Advances in Cryptology - ASIA CRYPT'98, volume 1514 of Lecture Notes in Computer Science, pages 357-371. Springer, 1998.
22. X. Wang, D. Feng, X. Lai, and H. Yu. Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive TR-199, 2004.