Advertisement

A Thirty Year Old Conjecture about Promise Problems

  • Andrew Hughes
  • A. Pavan
  • Nathan Russell
  • Alan Selman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7391)

Abstract

Even, Selman, and Yacobi [ESY84, SY82] formulated a conjecture that in current terminology asserts that there do not exist disjoint NP-pairs all of whose separators are NP-hard viaTuring reductions. In this paper we consider a variant of this conjecture—there do not exist disjoint NP-pairs all of whose separators are NP-hard via bounded-truth-table reductions. We provide evidence for this conjecture. We also observe that if the original conjecture holds, then some of the known probabilistic public-key cryptosystems are not NP-hard to crack.

Keywords

Proof System Satisfying Assignment Homomorphic Encryption Reasonable Hypothesis Promise Problem 
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. [AD97]
    Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 284–293. ACM, New York (1997)CrossRefGoogle Scholar
  2. [Agr02]
    Agrawal, M.: Pseudo-random generators and structure of complete degrees. In: 17th Annual IEEE Conference on Computational Complexity, pp. 139–145 (2002)Google Scholar
  3. [AM77]
    Adleman, L., Manders, K.: Reducibility, randomness, and intractability. In: Proc. 9th ACM Symp. Theory of Computing, pp. 151–163 (1977)Google Scholar
  4. [ASB00]
    Ambos-Spies, K., Bentzien, L.: Separating NP-completeness under strong hypotheses. Journal of Computer and System Sciences 61(3), 335–361 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  5. [ASFH87]
    Ambos-Spies, K., Fleischhack, H., Huwig, H.: Diagonalizations over polynomial time computable sets. Theoretical Computer Science 51, 177–204 (1987)MathSciNetzbMATHCrossRefGoogle Scholar
  6. [ASNT96]
    Ambos-Spies, K., Neis, H., Terwijn, A.: Genericity and measure for exponential time. Theoretical Computer Science 168(1), 3–19 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  7. [ASTZ97]
    Ambos-Spies, K., Terwijn, A., Zheng, X.: Resource bounded randomness and weakly complete problems. Theoretical Computer Science 172(1), 195–207 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  8. [BHHT10]
    Buhrman, H., Hescott, B., Homer, S., Torenvliet, L.: Non-uniform reductions. Theory of Computing Systems 47(2), 317–241 (2010)Google Scholar
  9. [BM95]
    Balcazar, J., Mayordomo, E.: A note on genericty and bi-immunity. In: Proceedings of the Tenth Annual IEEE Conference on Computational Complexity, pp. 193–196 (1995)Google Scholar
  10. [ESY84]
    Even, S., Selman, A., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Information and Control 61(2), 159–173 (1984)MathSciNetzbMATHCrossRefGoogle Scholar
  11. [For]
    Fortnow, L.: Personal CommunicationGoogle Scholar
  12. [Gen09]
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169–178 (2009)Google Scholar
  13. [GHP10]
    Gu, X., Hitchcock, J., Pavan, A.: Collapsing and separating completeness notions under average-case and worst-case hypotheses. In: STACS 2010. LIPIcs, vol. 5, pp. 429–440. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)Google Scholar
  14. [GM84]
    Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comp. System Sci. 28, 270–299 (1984)MathSciNetzbMATHCrossRefGoogle Scholar
  15. [Gol06]
    Goldreich, O.: On Promise Problems: A Survey. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Shimon Even Festchrift. LNCS, vol. 3895, pp. 254–290. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. [GS88]
    Grollmann, J., Selman, A.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing 17(2), 309–355 (1988)MathSciNetzbMATHCrossRefGoogle Scholar
  17. [GSSZ04]
    Glaßer, C., Selman, A., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM J. Comput. 33(6), 1369–1416 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  18. [GSZ07]
    Glaßer, C., Selman, A., Zhang, L.: Canonical disjoint NP-pairs of propositional proof systems. Theoretical Computer Science 370(1), 60–73 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  19. [HP07]
    Hitchcock, J., Pavan, A.: Comparing reductions to NP-complete sets. Information and Computation 205(5), 694–706 (2007); In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 465–476. Springer, Heidelberg (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  20. [LM96]
    Lutz, J.H., Mayordomo, E.: Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoretical Computer Science 164, 141–163 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  21. [NS98]
    Nguyên, P.Q., Stern, J.: Cryptanalysis of the Ajtai-Dwork Cryptosystem. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 223–242. Springer, Heidelberg (1998)Google Scholar
  22. [PS02]
    Pavan, A., Selman, A.: Separation of NP-completeness notions. SIAM Journal on Computing 31(3), 906–918 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  23. [PS04]
    Pavan, A., Selman, A.: Bi-immunity separates strong NP-completeness notions. Information and Computation 188, 116–126 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  24. [Pud01]
    Pudlak, P.: On reducibility and symmetry of disjoint NP-pairs. In: Electronic Colloquium on Computational Complexity, technical reports (2001)Google Scholar
  25. [Raz94]
    Razborov, A.: On provably disjoint NP pairs. Technical Report 94-006, ECCC (1994)Google Scholar
  26. [Sch60]
    Schoenfield, J.: Degrees of models. Journal of Symbolic Logic 25, 233–237 (1960)MathSciNetCrossRefGoogle Scholar
  27. [SY82]
    Selman, A., Yacobi, Y.: The Complexity of Promise Problems. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 502–509. Springer, Heidelberg (1982)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Andrew Hughes
    • 1
  • A. Pavan
    • 2
  • Nathan Russell
    • 1
  • Alan Selman
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity at BuffaloUSA
  2. 2.Department of Computer ScienceIowa State UniversityUSA

Personalised recommendations