ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR14-108 | 11th August 2014 10:33

On Basing Size-Verifiable One-Way Functions on NP-Hardness

RSS-Feed




Revision #1
Authors: Andrej Bogdanov, Christina Brzuska
Accepted on: 11th August 2014 10:33
Downloads: 792
Keywords: 


Abstract:

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 coAM is contained in NP. This
claim was made by Akavia, Goldreich, Goldwasser, and Moshkovitz (STOC 2006), but
was later retracted (STOC 2010).


Paper:

TR14-108 | 10th August 2014 18:16

On Basing Size-Verifiable One-Way Functions on NP-Hardness





TR14-108
Authors: Andrej Bogdanov, Christina Brzuska
Publication: 10th August 2014 23:16
Downloads: 624
Keywords: 


Abstract:

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 coAM is contained in NP. This
claim was made by Akavia, Goldreich, Goldwasser, and Moshkovitz (STOC 2006), but
was later retracted (STOC 2010).



ISSN 1433-8092 | Imprint