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).
[1] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Oded Goldreich,et al. On basing one-way functions on NP-hardness , 2006, STOC '06.
[3] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.