Characterizations of the Existence of Partial and Total One-Way Permutations

In this note, we study the easy certificate classes introduced by Hemaspaandra, Rothe, and Wechsung, with regard to the question of whether or not surjective one-way functions exist. This is an important open question in cryptology. We show that the existence of partial one-way permutations can be characterized by separating P from the class of UP sets that, for all unambiguous polynomial-time Turing machines accepting them, always have easy (i.e., polynomial-time computable) certificates. This extends results of Grollmann and Selman. By Gr\"adel's recent results about one-way functions, this also links statements about easy certificates of NP sets with statements in finite model theory. Similarly, there exist surjective poly-one one-way functions if and only if there is a set L in P such that not all FewP machines accepting L always have easy certificates. We also establish a condition necessary and sufficient for the existence of (total) one-way permutations.

[1]  Erich Grädel.  Definability on finite structures and the existence of one-way functions , 1994, Methods Log. Comput. Sci..

[2]  Jörg Rothe,et al.  Easy sets and hard certificate schemes , 1995, Acta Informatica.

[3]  Pierluigi Crescenzi,et al.  Sperner's lemma and robust machines , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[4]  Lane A. Hemaspaandra,et al.  On the Complexity of Ranking , 1990, J. Comput. Syst. Sci..

[5]  Jörg Rothe,et al.  On Sets with Easy Certificates and the Existence of One-Way Permutations , 1997, CIAC.

[6]  Edith Hemaspaandra,et al.  Quasi-injective Reductions , 1994, Theor. Comput. Sci..

[7]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[8]  Tadao Takaoka,et al.  Proceedings of the 12th International Symposium on Algorithms and Computation , 1995 .

[9]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[10]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[11]  Moni Naor,et al.  Decision trees and downward closures , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[12]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[13]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[14]  Yacov Yacobi,et al.  Cryptocomplexity and NP-Completeness , 1980, ICALP.

[15]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1986, Theor. Comput. Sci..

[16]  Lance Fortnow,et al.  Separability and One-Way Functions , 1994, ISAAC.

[17]  Johan Hstad,et al.  Construction of a pseudo-random generator from any one-way function , 1989 .

[18]  Osamu Watanabe.  On Polynomial Time One-Truth-Table Reducibility to a Sparse Set , 1992, J. Comput. Syst. Sci..

[19]  Eric Allender,et al.  The Complexity of Sparse Sets in P , 1986, SCT.

[20]  Russell Impagliazzo,et al.  Limits on the provable consequences of one-way permutations , 1988, STOC '89.

[21]  Ker-I Ko,et al.  On Some Natural Complete Operators , 1985, Theor. Comput. Sci..

[22]  Osamu Watanabe,et al.  On Hardness of One-Way Functions , 1988, Inf. Process. Lett..

[23]  Eric Allender,et al.  P-Printable Sets , 1988, SIAM J. Comput..

[24]  Jörg Rothe,et al.  Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets , 1997, SIAM J. Comput..

[25]  Alan J. Demers,et al.  Some Comments on Functional Self-Reducibility and the NP Hierarchy , 1976 .

[26]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[27]  Andrew V. Goldberg,et al.  Compression and ranking , 1985, STOC '85.