On Basing Size-Verifiable One-Way Functions on NP-Hardness
We prove that if the hardness of inverting a size-verifiable one-way function can be based on NP-hardness via a general (adaptive) reduction, then NP ⊆ coAM. This claim was made by Akavia, Goldreich, Goldwasser, and Moshkovitz (STOC 2006), but was later retracted (STOC 2010).
KeywordsProof System Interactive Proof Query Length Promise Problem Interactive Proof System
Unable to display preview. Download preview PDF.
- [AGGM10]Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: Erratum for: On basing one-way functions on NP-hardness. In: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC 2010, pp. 795–796. ACM, New York (2010)Google Scholar
- [IL89]Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, October- 30 November 1, pp. 230–235. IEEE Computer Society (1989)Google Scholar