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

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

Documents Related by Co-Citation

73 Finding Collisions on a One-Way Street: Can Secure Hash Functions be Based on General Assumptions – Daniel R. Simon - 1998
166 Limits on the Provable Consequences of One-way Permutations – Russell Impagliazzo, Steven Rudich - 1989
61 Lower bounds on the Efficiency of Generic Cryptographic Constructions – Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan - 2000
64 Notions of Reducibility between Cryptographic Primitives – Omer Reingold, Luca Trevisan, Salil Vadhan - 2004
55 The relationship between public key encryption and oblivious transfer – Y Gertner, S Kannan, T Malkin, O Reingold, M Viswanathan - 2000
36 On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates (Extended Abstract) – Yael Gertner, Tal Malkin, Omer Reingold
734 Pseudo-Random Generation from One-Way Functions – Johan HÃ¥stad, Russell Impagliazzo, Leonid A. Levin, Michael Luby - 1988
237 Bit Commitment Using Pseudo-Randomness – Moni Naor - 1991
454 Non-Malleable Cryptography – Danny Dolev, Cynthia Dwork, Moni Naor - 2000