(Enter summary)
Abstract: There are many natural examples of conjectured one-way functions, whereas pseudorandom
generators have a number of important applications, including the construction
of a private key cryptosystem that is provably secure. We show how to construct
a pseudo-random generator from any one-way function. Our constructions make extensive
use of hashing to extract and smooth entropy from a one-way function.
1 Introduction
One of the basic primitives in cryptography and other areas of computer science... (Update)
Cited by: More
Collision-Free Hashing from Lattice Problems - Oded Goldreich Shafi (1996)
(Correct)
Tolerant Combiners: Resilient Cryptographic Design - Herzberg (2002)
(Correct)
Resettable Zero-Knowledge - Canetti, Goldreich, Goldwasser.. (2000)
(Correct)
Similar documents (at the sentence level):
68.2%: Construction of a Pseudo-Random Generator - From Any One-Way
(Correct)
17.6%: A Pseudorandom Generator from any One-way Function - Håstad, Impagliazzo, Levin.. (1999)
(Correct)
Active bibliography (related documents): More All
0.3: Randomness, Pseudorandomness, and its Applications to Cryptography - Giuliani (1998)
(Correct)
0.1: Stream Ciphers - Robshaw (1995)
(Correct)
0.1: "Pseudo-Random" Number Generation within.. - Bellare, Goldwasser, .. (1997)
(Correct)
Similar documents based on text: More All
0.2: Security Preserving Amplification of Hardness - Goldreich, Impagliazzo.. (1990)
(Correct)
0.2: Oneway Permutations in NC^0 - Håstad
(Correct)
0.2: A CORBA-Based Object Group Service and a Join Service.. - Aleksy, Korthaus (2000)
(Correct)
Related documents from co-citation: More All
36: How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1984
22: A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
20: The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
BibTeX entry: (Update)
J. Hastad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One-Way Function. Manuscript, 1993. See preliminary versions by Impagliazzo et. al. in 21st STOC and Hastad in 22nd STOC. http://citeseer.ist.psu.edu/hastad93construction.html More
@misc{ hastad93construction,
author = "J. Hastad and R. Impagliazzo and L. Levin and M. Luby",
title = "Construction of Pseudorandom Generator from any One-Way Function",
text = "J. Hastad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom
Generator from any One-Way Function. Manuscript, 1993. See preliminary versions
by Impagliazzo et. al. in 21st STOC and Hastad in 22nd STOC.",
year = "1993",
url = "citeseer.ist.psu.edu/hastad93construction.html" }
Citations (may not include all citations):
1529
A method for obtaining digital signatures and public-key cry..
- Rivest, Shamir et al. - 1978
1447
A Mathematical Theory of Communication (context) - Shannon - 1948
635
New directions in cryptography
- Diffie, Hellman - 1976
358
Universal Classes of Hash Functions (context) - Carter - 1979
339
Theory and Applications of Trapdoor Functions (context) - Yao - 1982
128
A Complexity Theoretic Approach to Randomness (context) - Sipser - 1983
110
Proofs that Yield Nothing but Their Validity and a Methodolo.. (context) - Goldreich, Micali et al. - 1986
99
One-way Functions are Necessary and Sufficient for Secure Si.. (context) - Rompel - 1990
84
Privacy Amplification by Public Discussion (context) - Bennett, Brassard et al. - 1988
78
Semi-Numerical Algorithm (context) - Knuth - 1981
60
A Hard-Core Predicate for any One-way Function (context) - Goldreich - 1989
55
Pseudo-Random Generators under Uniform Assumptions (context) - Hastad - 1990
46
Efficient Cryptographic Schemes Provably as Secure as Subset..
- Impagliazzo, Naor - 1989
46
Random Polynomial Time is Equal to Slightly-random Polynomia.. (context) - Vazirani, Vazirani - 1985
41
One-way Functions are Essential for Non-Trivial Zero-Knowled..
- Ostrovsky, Wigderson - 1993
40
Probability Theory (context) - Renyi - 1970
36
Security Preserving Amplification of Hardness
- Goldreich, Impagliazzo et al. - 1990
29
Independent Unbiased Coin Flips From a Correlated Biased Sou.. (context) - Blum - 1984
27
Pseudo-random generators and complexity classes (context) - Boppana, Hirschfeld - 1989
25
Pseudo-randomness and Applications (context) - Luby
23
Efficient and Secure Pseudo-Random Number Generation (context) - Vazirani, Vazirani - 1984
20
Limits on the Provable Consequences of One-way Functions
- Impagliazzo, Rudich - 1989
19
Pseudo-random number generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
14
Inferring a Sequence Generated by a Linear Congruence (context) - Plumstead - 1982
10
personal communication (context) - Naor - 1988
10
How to Predict Congruential Generators (context) - Krawczyk - 1989
8
Public Randomness in Cryptography
- Herzberg, Luby - 1992
5
Cryptography Using Weak Sources of Randomness (context) - McInnes - 1987
4
Universal One-way Hash Functions and Their Applications (context) - Naor, Yung - 1989
4
One-way functions are essential for information based crypto.. (context) - Impagliazzo, Luby - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995)
(Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991)
(Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997)
(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