Theory of Cryptography Conference

TCC 2005: Theory of Cryptography pp 445-456

Sufficient Conditions for Collision-Resistant Hashing

  • Yuval Ishai
  • Eyal Kushilevitz
  • Rafail Ostrovsky
Conference paper

DOI: 10.1007/978-3-540-30576-7_24

Volume 3378 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ishai Y., Kushilevitz E., Ostrovsky R. (2005) Sufficient Conditions for Collision-Resistant Hashing. In: Kilian J. (eds) Theory of Cryptography. TCC 2005. Lecture Notes in Computer Science, vol 3378. Springer, Berlin, Heidelberg


We present several new constructions of collision-resistant hash-functions (CRHFs) from general assumptions. We start with a simple construction of CRHF from any homomorphic encryption. Then, we strengthen this result by presenting constructions of CRHF from two other primitives that are implied by homomorphic-encryption: one-round private information retrieval (PIR) protocols and homomorphic one-way commitments.


Collision-resistant hash functionshomomorphic encryptionprivate information-retrieval
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yuval Ishai
    • 1
  • Eyal Kushilevitz
    • 1
  • Rafail Ostrovsky
    • 2
  1. 1.Computer Science DepartmentTechnionHaifaIsrael
  2. 2.Computer Science DepartmentUCLA