Limits on the Efficiency of One-Way Permutation-Based Hash Functions (1999)

Cached

Download Links

by Jeong Han Kim , Daniel R. Simon , Prasad Tetali
Venue:In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science
Citations:20 - 0 self

Documents Related by Co-Citation

48 Lower bounds on the Efficiency of Generic Cryptographic Constructions – Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan - 2000
138 Limits on the Provable Consequences of One-way Permutations – Russell Impagliazzo, Steven Rudich - 1989
44 The Relationship Between Public Key Encryption and Oblivious Transfer – Y Gertner, S Kannan, T Malkin, O Reingold, M Viswanathan - 2000
62 Finding Collisions on a One-Way Street: Can Secure Hash Functions be Based on General Assumptions – Daniel R. Simon - 1998
44 Notions of Reducibility between Cryptographic Primitives – Omer Reingold, Luca Trevisan, Salil Vadhan - 2004
26 On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates (Extended Abstract) – Yael Gertner, Tal Malkin, Omer Reingold
23 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
410 Non-Malleable Cryptography – Danny Dolev, Cynthia Dwork, Moni Naor - 2000
327 Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems – Silvio Micali - 1991
18 On the Impossibility of Constructing Non-Interactive Statistically-Secret Protocols from any Trapdoor One-Way Function – Marc Fischlin - 2002
601 Pseudo-Random Generation from One-Way Functions – Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby - 1988
284 Universal One-Way Hash Functions and their Cryptographic Applications – Moni Naor, Moti Yung - 1989
425 How to play any mental game, or a completeness theorem for protocols with honest majority – O Goldreich, S Micali, A Wigderson - 1987
127 Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security – Amit Sahai - 1999
113 Foundations of Cryptography: Volume 2 – Basic Applications – O Goldreich - 2004
11 One-way permutations, interactive hashing and statistically hiding commitments – H Wee - 2007
206 Bit Commitment Using Pseudo-Randomness – Moni Naor - 1991
175 How to Go Beyond the Black-Box Simulation Barrier – Boaz Barak - 2001
171 One-way functions are necessary and sufficient for secure signatures – John Rompel - 1990