A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the existence of pseudorandom generators
SIAM Journal on Computing
Journal of Computer and System Sciences
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
On Constructing Parallel Pseudorandom Generators from One-Way Functions
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Bounds on the Efficiency of Generic Cryptographic Constructions
SIAM Journal on Computing
SIAM Journal on Computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Efficiency improvements in constructing pseudorandom generators from one-way functions
Proceedings of the forty-second ACM symposium on Theory of computing
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 parallel hardness amplification for one-way functions
TCC'06 Proceedings of the Third 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
| Hi-index | 0.00 |
We study the complexity of black-box constructions of linear-stretch pseudorandom generators starting from a 1-bit stretch oracle generator G. We show that there is no construction which makes non-adaptive queries to G and then just outputs bits of the answers. The result extends to constructions that both work in the non-uniform setting and are only black-box in the primitive G (not the proof of correctness), in the sense that any such construction implies NP/poly ≠ P/poly. We then argue that not much more can be obtained using our techniques: via a modification of an argument of Reingold, Trevisan, and Vadhan (TCC '04), we prove in the non-uniform setting that there is a construction which only treats the primitive G as black-box, has polynomial stretch, makes non-adaptive queries to the oracle G, and outputs an affine function (i.e., parity or its complement) of the oracle query answers.