Efficiency improvements in constructing pseudorandom generators from one-way functions

Authors:
Iftach Haitner;Omer Reingold;Salil Vadhan
Affiliations:
Microsoft Research - New England Campus, Cambridge, MA, USA;Microsoft Research - Silicon Valley & Weizmann Institute of Science, Mountain view, CA, USA;Harvard University, Cambridge, MA, USA
Venue:
Proceedings of the forty-second ACM symposium on Theory of computing
Year:
2010

Citing 24
Cited 12

A theory of the learnable

Communications of the ACM
How to construct random functions

Journal of the ACM (JACM)
Unbiased bits from sources of weak randomness and probabilistic communication complexity

SIAM Journal on Computing - Special issue on cryptography
How to construct pseudorandom permutations from pseudorandom functions

SIAM Journal on Computing - Special issue on cryptography
Zero-knowledge proofs of identity

Journal of Cryptology
Pseudo-random generation from one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
On the existence of pseudorandom generators

SIAM Journal on Computing
Natural proofs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Pseudorandom generators without the XOR lemma

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A personal view of average-case complexity

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model

Journal of Cryptology
Key agreement from weak bit agreement

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Cryptography in $NC^0$

SIAM Journal on Computing
How to recycle random bits

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Inaccessible entropy

Proceedings of the forty-first annual ACM symposium on Theory of computing
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

SIAM Journal on Computing
Efficient pseudorandom generators from exponentially hard one-way functions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On the power of the randomized iterate

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Pseudorandom generators from one-way functions: a simple construction for any hardness

TCC'06 Proceedings of the Third conference on Theory of Cryptography

General hardness amplification of predicates and puzzles

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Limits on the stretch of non-adaptive constructions of pseudo-random generators

TCC'11 Proceedings of the 8th conference on Theory of cryptography
On the complexity of non-adaptively increasing the stretch of pseudorandom generators

TCC'11 Proceedings of the 8th conference on Theory of cryptography
On constructing 1-1 one-way functions

Studies in complexity and cryptography
Universal one-way hash functions via inaccessible entropy

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
A new pseudorandom generator from collision-resistant hash functions

CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Pseudorandom generators with long stretch and low locality from random local one-way functions

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Characterizing pseudoentropy and simplifying pseudorandom generator constructions

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the Power of the Randomized Iterate

SIAM Journal on Computing
Public-Key cryptography from new multivariate quadratic assumptions

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
UOWHFs from OWFs: trading regularity for efficiency

LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Sparse extractor families for all the entropy

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin, and Luby [SICOMP '99]. The key to our construction is a new notion of "next-block pseudoentropy", which is inspired by the notion of "inaccessible entropy" recently introduced in [Haitner, Reingold, Vadhan, Wee, STOC '09]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, Kushilevitz, SICOMP '06], this implies the existence of pseudorandom generators in NC^0 based on the existence of one-way functions in NC^1.