Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky  Home/Search
Context Related
| ucla.edu/~rafail/PUBLIC/66.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/~rafail/PUBLIC/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Cited by: More
On Security of Sublinear Oblivious Transfer - Laur, Lipmaa (2006) (Correct)
Active bibliography (related documents): More All
0.5: Key-Insulated Public-Key Cryptosystems - Dodis, Katz, Xu, Yung (2002) (Correct)
0.3: How to Go Beyond the Black-Box Simulation Barrier - Barak (2001) (Correct)
0.2: Universal Arguments and their Applications - Barak, Goldreich (2001) (Correct)
Similar documents based on text: More All
0.6: One-way Functions are Essential for Single-Server.. - Beimel, Ishai.. (1999) (Correct)
0.5: Efficient Search for Approximate Nearest Neighbor in.. - Kushilevitz.. (1998) (Correct)
0.5: One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000) (Correct)
BibTeX entry: (Update)
Yuval Ishai, Eyal Kushilevitz, and Rafail Ostrovsky. Sufficient Conditions for Collision-Resistant Hashing. In Joe Kilian, editor, The Second Theory of Cryptography Conference, TCC http://citeseer.ist.psu.edu/726875.html More
@misc{ ishai-sufficient,
author = "Y. Ishai and E. Kushilevitz and R. Ostrovsky",
title = "Sufficient Conditions for Collision-Resistant Hashing",
text = "Yuval Ishai, Eyal Kushilevitz, and Rafail Ostrovsky. Sufficient Conditions
for Collision-Resistant Hashing. In Joe Kilian, editor, The Second Theory
of Cryptography Conference, TCC",
url = "citeseer.ist.psu.edu/726875.html" }
Citations (may not include all citations):404 Journal of Computer and systems sciences (context) - Goldwasser, Micali - 1984
98 Computationally private information retrieval with polylogar.. - Cachin, Micali et al. - 1999
81 Replication is Not Needed: Single Database (context) - Kushilevitz, Ostrovsky - 1997
56 How to Go Beyond the Black-Box Simulation Barrier - Barak - 2001
36 Private access to distributed information - Mann - 1998
30 the existence of statistically hiding bit commitment schemes.. - Damgard, Pedersen et al. - 1993
29 Finding Collisions on a One-Way Street: Can Secure Hash Func.. (context) - Simon - 1998
26 Practical and Provably-Secure Commitment Schemes from Collis.. - Halevi, Micali - 1996
22 One-Way Functions Are Essential for Single-Server Private In.. - Beimel, Ishai et al. - 1999
13 cient all-or-nothing disclosure of secrets protocol (context) - Stern, new - 1998
13 Universal Arguments and their Applications - Barak, Goldreich - 2002
11 Collision-Free Hashing from Lattice Problems - Goldreich, Goldwasser et al. - 1996
7 the Impossibility of Constructing Non-interactive Statistica.. - Fischlin - 2002
4 cient Zero-Knowledge Proofs and Arguments (context) - Kilian, on - 1992
4 Volume II: Basic Applications (context) - Goldreich, Cryptography - 2004
4 Volume I: Basic Tools (context) - Goldreich, Cryptography - 2001
2 Necessary and Su#cient Conditions for Collision-Free Hashing (context) - Russell - 1995
1 Early version appeared in FOCS (context) - Micali, SIAM et al. - 1994
1 Early version appeared in AsiaCrypt (context) - Ogata, Kurosawa et al. - 1994
1 or Do Secure Hash Functions Need Secret Coins (context) - Hsiao, Reyzin et al. - 2004
1 Cryptology ePrint Archive TR (context) - Wang, Feng et al. - 2004
Documents on the same site (http://www.cs.ucla.edu/~rafail/PUBLIC/index.html): More
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC