Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth 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
Threshold circuits of bounded depth
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Lower bounds for sampling algorithms for estimating the average
Information Processing Letters
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
On the hardness of computing the permanent of random matrices
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
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
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Randomness vs time: derandomization under a uniform assumption
Journal of Computer and System Sciences
Boosting and Hard-Core Set Construction
Machine Learning
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Lower Bounds for Approximations by Low Degree Polynomials Over Z_m
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
List-Decoding Using The XOR Lemma
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
On uniform amplification of hardness in NP
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
On Constructing Parallel Pseudorandom Generators from One-Way Functions
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
On the Complexity of Hardness Amplification
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Using Nondeterminism to Amplify Hardness
SIAM Journal on Computing
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
The complexity of hardness amplification and derandomization
The complexity of hardness amplification and derandomization
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
Note: Improved hardness amplification in NP
Theoretical Computer Science
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
On Approximate Majority and Probabilistic Time
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Foundations and Trends® in Theoretical Computer Science
On Worst-Case to Average-Case Reductions for NP Problems
SIAM Journal on Computing
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Uniform direct product theorems: simplified, optimized, and derandomized
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness Amplification within NP against Deterministic Algorithms
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Separating the polynomial-time hierarchy by oracles
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On hardness amplification of one-way functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Hardness amplification via space-efficient direct products
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Impossibility results on weakly black-box hardness amplification
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the complexity of hard-core set constructions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The Complexity of Local List Decoding
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
On the Security Loss in Cryptographic Reductions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Bit-probe lower bounds for succinct data structures
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Hi-index | 0.00 |
Hardness amplification is the fundamental task of converting a δ-hard function f : (0, 1)n - (0, 1) into a (1/2-ε)-hard function Amp(f), where f is γ-hard if small circuits fail to compute f on at least a γ fraction of the inputs. Typically, ε,δ are small (and δ=2-k captures the case where f is worst-case hard). Achieving ε = 1/nΩ(1) is a prerequisite for cryptography and most pseudorandom-generator constructions. In this paper we study the complexity of black-box proofs of hardness amplification. A class of circuits cal D proves a hardness amplification result if for any function h that agrees with Amp(f) on a 1/2+e fraction of the inputs there exists an oracle circuit D ∈ D such that Dh agrees with f on a 1-δ fraction of the inputs. We focus on the case where every D ∈ D makes non-adaptive queries to h. This setting captures most hardness amplification techniques. We prove two main results: The circuits in D "can be used" to compute the majority function on 1e bits. In particular, these circuits have large depth when ε ≤ 1/ poly log n. The circuits in D must make Ω log(1/δ)/e2 oracle queries. Both our bounds on the depth and on the number of queries are tight up to constant factors. Our results explain why hardness amplification techniques have failed to transform known lower bounds against constant-depth circuit classes into strong average-case lower bounds. When coupled with the celebrated "Natural Proofs" result by Razborov and Rudich (J. CSS '97) and the pseudorandom functions by Naor and Reingold (J. ACM '04), our results show that standard techniques for hardness amplification can only be applied to those circuit classes for which standard techniques cannot prove circuit lower bounds. Our results reveal a contrast between Yao's XOR Lemma (Amp(f) := f(x1) ⊕ ... ⊕ f(xt) ∈ zo) and the Direct-Product Lemma (Amp(f) := f(x1) O ... O f(xt) ∈ zot; here Amp(f) is non-Boolean). Our results (1) and (2) apply to Yao's XOR lemma, whereas known proofs of the direct-product lemma violate both (1) and (2). One of our contributions is a new technique to handle "non-uniform" reductions, i.e. the case when D contains many circuits.