Advertisement

One-way functions in complexity theory

  • Alan L. Selman
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)

Abstract

In complexity theory a one-way function is defined to be a one-one, honest, function that is computable in polynomial time whose inverse is not computable in polynomial time. We will examine relationships between the complexity of functional computational problems and ordinary set recognition problems. The complexity of inverting one-way functions will follow from these relationships. Then, we will survey various forms of one-way functions that have arisen in relationship to some cryptographic investigations and in relationship to the Isomorphism Problem.

Keywords

Polynomial Time Turing Machine Complexity Theory Multivalued Function Input String 
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. [Ber77]
    L. Berman. Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University, 1977.Google Scholar
  2. [BH77]
    L. Berman and H. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comput., 6:305–322, 1977.Google Scholar
  3. [Gan89]
    K. Ganesan. Complete problems, creative sets and isomorphism conjectures. PhD thesis, Boston University, Boston, MA, 1989.Google Scholar
  4. [GS84]
    J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. In Proc. 25th IEEE Symp. on Foundations of Computer Science, pages 495–503, 1984.Google Scholar
  5. [GS88]
    J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM J. Comput., 11(2):, April 1988.Google Scholar
  6. [JY85]
    D. Joseph and P. Young. Some remarks on witness functions for non-polynomial and non-complete sets in NP. Theoret. Comput. Sci., 39:225–237, 1985.Google Scholar
  7. [KLD87]
    K. Ko, T. Long, and D. Du. A note on one-way functions and polynomial-time isomorphisms. Theoretical Computer Science, 47:263–276, 1987.Google Scholar
  8. [KM81]
    K. Ko and D. Moore. Completeness, approximation and density. SIAM J. Comput., 10(4):787–796, Nov. 1981.Google Scholar
  9. [KMR89]
    S. Kurtz, S. Mahaney, and J. Royer. The isomorphism conjecture fails relative to a random oracle. In Proc. 21st Annual ACM Symp. on Theory of Comput., pages 157–166, 1989.Google Scholar
  10. [KMR90]
    S. Kurtz, S. Mahaney, and J. Royer. The structure of complete degrees. In A. Selman, editor, Complexity Theory Retrospective, pages 108–146, Springer-Verlag, 1990.Google Scholar
  11. [Ko85]
    K. Ko. On some natural complete operators. Theoret. Comput. Sci., 37:1–30, 1985.Google Scholar
  12. [Kre88]
    M. Krentel. The complexity of optimization problems. J. Computer Systems Sci., 36:490–509, 1988.Google Scholar
  13. [Mil76]
    G. Miller. Reimann's hypothesis and tests for primality. J. Comp. System Sci., 13:300–317, 1976.Google Scholar
  14. [MY85]
    S. Mahaney and P. Young. Orderings of polynomial isomorphism types. Theor. Comput. Sci., 39(2):207–224, August 1985.Google Scholar
  15. [Myh55]
    J. Myhill. Creative sets. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1:97–108, 1955.Google Scholar
  16. [Pos44]
    E. Post. Recursively enumerable sets of integers and their decision problems. Bull. Amer. Math. Soc., 50:284–316, 1944.Google Scholar
  17. [Sel78]
    A. Selman. Polynomial time enumeration reducibility. SIAM J. Comput., 7(4):440–457, November 1978.Google Scholar
  18. [Sel88]
    A. Selman. Natural self-reducible sets. SIAM J. Comput., 17:989–996, 1988.Google Scholar
  19. [SXB83]
    A. Selman, Xu M.-R., and R. Book. Positive relativizations of complexity classes. SIAM J. Comput., 12:465–479, 1983.Google Scholar
  20. [Tod89]
    S. Toda. On the computational power of PP and ⊕P. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 514–519, 1989.Google Scholar
  21. [Val76]
    L. Valiant. Relative complexity of checking and evaluating. Information Processing Letters, 5(1):20–23, May 1976.Google Scholar
  22. [Wan]
    J. Wang. Some remarks on polynomial time isomorphisms. manuscript, 1990.Google Scholar
  23. [Wan89]
    J. Wang. On P-creative sets vs. P-completely creative sets. In Proc. 4th IEEE Structure in Complexity Theory Conference, pages 24–33, 1989.Google Scholar
  24. [Wan90]
    J. Wang. Polynomial time creativity and its applications. PhD thesis, Boston University, Boston, MA, 1990.Google Scholar
  25. [Wat85]
    O. Watanabe. On one-one polynomial time equivalence relations. Theoret. Comput. Sci., 38:157–165, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Alan L. Selman
    • 1
  1. 1.College of Computer ScienceNortheastern UniversityBoston

Personalised recommendations