How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Randomness vs time: derandomization under a uniform assumption
Journal of Computer and System Sciences
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On Worst-Case to Average-Case Reductions for NP Problems
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Nondeterministic exponential time has two-prover interactive protocols
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Limits on the computational power of random strings
Information and Computation
Hi-index | 0.00 |
We consider (uniform) reductions from computing a function fto the task of distinguishing the output of some pseudorandom generator Gfrom uniform. Impagliazzo and Wigderson [10] and Trevisan and Vadhan [24] exhibited such reductions for every function fin PSPACE. Moreover, their reductions are "black box," showing how to use anydistinguisher T, given as oracle, in order to compute f(regardless of the complexity of T). The reductions are also adaptive, but with the restriction that queries of the same length do not occur in different levels of adaptivity. Impagliazzo and Wigderson [10] also exhibited such reductions for every function fin EXP, but those reductions are not black-box, because they only work when the oracle Tis computable by small circuits.Our main results are that:Nonadaptiveblack-box reductions as above can only exist for functions fin BPPNP(and thus are unlikely to exist for all of PSPACE).Adaptiveblack-box reductions, with the same restriction on the adaptivity as above, can only exist for functions fin PSPACE (and thus are unlikely to exist for all of EXP).Beyond shedding light on proof techniques in the area of hardness vs. randomness, our results (together with [10,24]) can be viewed in a more general context as identifying techniques that overcome limitations of black-box reductions, which may be useful elsewhere in complexity theory (and the foundations of cryptography).