On basing one-way functions on NP-hardness

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:

• Type: Conference
• Year: 2006
• Where: STOC
• Authors: Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz
• Keywords: Algorithms, One-way Functions, Polynomial-time Computable Function, STOC 2006, Worst-case Decision Problem