Sufficient conditions for collision-resistant hashing

Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky

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

Sufficient conditions for collision-resistant hashing

Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky

Computer Science

Research output: Contribution to journal › Conference article › peer-review

41 Scopus citations

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.

Original language	English
Pages (from-to)	445-456
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	3378
DOIs	https://doi.org/10.1007/978-3-540-30576-7_24
State	Published - 2005
Event	Second Theory of Cryptography Conference, TCC 2005 - Cambridge, MA, United States Duration: 10 Feb 2005 → 12 Feb 2005

Keywords

Collision-resistant hash functions
Homomorphic encryption
Private information-retrieval

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

@article{5c8f8feb0a3544c18ed3fc32f0761595,

title = "Sufficient conditions for collision-resistant hashing",

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",

author = "Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky",

year = "2005",

doi = "10.1007/978-3-540-30576-7_24",

language = "אנגלית",

volume = "3378",

pages = "445--456",

note = "Second Theory of Cryptography Conference, TCC 2005 ; Conference date: 10-02-2005 Through 12-02-2005",

}

TY - JOUR

T1 - Sufficient conditions for collision-resistant hashing

AU - Ishai, Yuval

AU - Kushilevitz, Eyal

AU - Ostrovsky, Rafail

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Collision-resistant hash functions

KW - Homomorphic encryption

KW - Private information-retrieval

UR - http://www.scopus.com/inward/record.url?scp=24144497043&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30576-7_24

DO - 10.1007/978-3-540-30576-7_24

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:24144497043

SN - 0302-9743

VL - 3378

SP - 445

EP - 456

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Second Theory of Cryptography Conference, TCC 2005

Y2 - 10 February 2005 through 12 February 2005

ER -

Sufficient conditions for collision-resistant hashing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this