Advertisement

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

  • Andrej Bogdanov
  • Christina Brzuska
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9014)

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

Keywords

Proof System Interactive Proof Query Length Promise Problem Interactive Proof System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AGGM06]
    Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 701–710. ACM, New York (2006)CrossRefGoogle Scholar
  2. [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
  3. [GS86]
    Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 59–68. ACM, New York (1986)CrossRefGoogle Scholar
  4. [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

Copyright information

© International Association for Cryptologic Research 2015

Authors and Affiliations

  • Andrej Bogdanov
    • 1
  • Christina Brzuska
    • 2
  1. 1.Dept. of Computer Science and EngineeringThe Chinese University of Hong KongChina
  2. 2.Microsoft ResearchCambridgeUK

Personalised recommendations