22 search results - page 3 / 5 » On uniform amplification of hardness in NP |
218
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
179
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
178
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
183
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
190
click to vote
APPROX
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...