A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
On basing one-way functions on NP-hardness
2006
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06
We 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 following two negative results: 1. If given y one can efficiently compute |f −1 (y)| then the existence of a (randomized) reduction of N P to the task of inverting f implies that coN P ⊆ AM. Thus, it follows that such reductions cannot exist unless
doi:10.1145/1132516.1132614
dblp:conf/stoc/AkaviaGGM06
fatcat:jxdclcu33jgrrks26r6ke2ay4a