Cryptographic Constructions Rosario Gennaro Luca Trevisan May 2, 2000  Home/Search
Context
Related
| iacr.org/2000/017.ps.gz 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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present lower bounds on the efficiency of constructions for Pseudo-Random Generators (PRGs) and Universal One-Way Hash Functions (UOWHFs) based on black-box access to one-way permutations. Our lower bounds are tight as they match the efficiency of known constructions. (Update)
Similar documents based on text: More All
0.6: Lower Bounds on the Efficiency of Generic Cryptographic.. - Gennaro, Trevisan (2000) (Correct)
0.2: Bounds on the Efficiency of Generic Cryptographic.. - Gennaro, Gertner, Katz, .. (Correct)
0.1: An Untraceable, Universally Verifiable Voting Scheme - Michael Radwin December (Correct)
BibTeX entry: (Update)
@misc{ rosario-lower,
author = "Cryptographic Constructions Rosario",
title = "Lower Bounds on the Efficiency of Generic",
url = "citeseer.ist.psu.edu/728041.html" }
Citations (may not include all citations):428 IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1978
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
339 Theory and applications of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
124 Bit commitment using pseudorandomness - Naor - 1991
95 Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich - 1989
90 A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
56 Proofs that yield nothing but their validity (context) - Goldreich, Micali et al. - 1991
40 Foundations of cryptography --- fragments of a book - Goldreich - 1995
29 Finding collisions on a one-way street: Can secure hash func.. (context) - Simon - 1998
24 The discrete logarithm modulo a composite hides O (context) - Hastad, Schrift et al. - 1993
20 Limits on the provable consequences of one-way functions - Rudich - 1988
17 Very strong one-way functions and pseudo-random generators e.. (context) - Impagliazzo - 1996
10 A dual version of Reimer's inequality and a proof of rudich'.. (context) - Kahn, Saks et al. - 2000
10 The use of interaction in public cryptosystems (context) - Rudich - 1991
6 Universal hash functions and their cryptographic application.. (context) - Naor, Yung - 1989
5 One-way functions are necessary and sufficient for digital s.. (context) - Rompel - 1990
2 Limits on the efficiency of one-way permutationsbased hash f.. (context) - Kim, Simon et al. - 1999
2 Trapdoor permutations with lots of hard bits: or efficient s.. (context) - Catalano, Gennaro - 2000
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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