Sufficient Conditions for Collision-Risistant Hashing
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
Abstract: 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.
Keywords: Collision-resistant hash functions, homomorphic encryption, private information-retrieval.
In Proceedings of Second Theory of Cryptography Conference (TCC) Springer-Verlag Lecture Notes in Computer Science, 2005
Fetch PostScript file of the paper Fetch PDF file of the paper