Adi Akavia
Oded Goldreich
Shafi Goldwasser
ABSTRACT
This is an errata for our STOC'06 paper, "On Basing One-Way Functions on NP-Hardness".
There is a gap in the proof of our results regarding adaptive reductions, and we currently do not know whether Theorem 3 (as stated in Section 2) holds.
Index Terms
- Erratum for: on basing one-way functions on NP-hardness
Recommendations
On basing one-way functions on NP-hardness
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingWe consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case inverting a polynomial-time computable function f. Our main findings are the ...
Analytical approach to parallel repetition
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computingWe propose an analytical framework for studying parallel repetition, a basic product operation for one-round twoplayer games. In this framework, we consider a relaxation of the value of projection games. We show that this relaxation is multiplicative ...
Comments