Necessary and Sufficient Conditions for Collision-Free Hashing (1995)

Cached

Download Links

by Alexander Russell
Venue:Journal of Cryptology
Citations:9 - 0 self

Active Bibliography

243 The Random Oracle Methodology, Revisited – Ran Canetti, Oded Goldreich, Shai Halevi - 1998
24 Reducing complexity assumptions for statistically-hiding commitment – Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel - 2005
1 Cryptography in Constant Parallel Time – Benny Applebaum - 2007
13 Structural properties of one-way hash functions – Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai - 1991
14 Interactive Hashing Simplifies Zero-Knowledge Protocol Design (Extended Abstract) – Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung - 1998
18 Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract) – Shafi Goldwasser, Rafail Ostrovsky - 1992
61 Lower bounds on the Efficiency of Generic Cryptographic Constructions – Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan - 2000
51 Security Preserving Amplification of Hardness – Oded Goldreich, Russell Impagliazzo, Leonid Levin, Ramarathnam Venkatesan, David Zuckerman - 1990
7 Duality between two cryptographic primitives – Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai - 1990
78 Efficient Cryptographic Schemes Provably as Secure as Subset Sum – Russell Impagliazzo, Moni Naor - 1993
“METAPROOFS” (and their Cryptographic Applications) – Alfredo De Santis, Moti Yung - 1990
20 Statistical Zero-Knowledge Arguments for NP from Any One-Way – Minh-Huyen Nguyen, Shien Jin Ong, Salil Vadhan - 2006
7 Bounds on the efficiency of “blackbox” commitment schemes – Omer Horvitz, Jonathan Katz - 2005
33 How to Sign Given Any Trapdoor Permutation – Mihir Bellare, Silvio Micali - 1992
16 Efficient generic forward-secure signatures with an unbounded number of time periods – Tal Malkin, Daniele Micciancio, Sara Miner - 2002
37 One-Way Functions are Essential for Non-Trivial Zero-Knowledge(Extended Abstract) – Rafail Ostrovsky, Avi Wigderson - 1993
33 Finding collisions in interactive protocols – A tight lower bound on the round complexity of statistically-hiding commitments – Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev - 2007
2 Connections among Several Versions of One-Way Hash Functions – Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai - 1990
12 New Solutions to the Problem of Access Control in a Hierarchy – Yuliang Zheng, Thomas Hardjono, Jennifer Seberry - 1993