• Corpus ID: 4000946

Low Ambiguity in Strong, Total, Associative, One-Way Functions

  title={Low Ambiguity in Strong, Total, Associative, One-Way Functions},
  author={Christopher Homan},
Rabi and Sherman present a cryptographic paradigm based on associative, one-way functions that are strong (i.e., hard to invert even if one of their arguments is given) and total. Hemaspaandra and Rothe proved that such powerful one-way functions exist exactly if (standard) one-way functions exist, thus showing that the associative one-way function approach is as plausible as previous approaches. In the present paper, we study the degree of ambiguity of one-way functions. Rabiand Sherman showed… 
One-Way Permutations and Self-Witnessing Languages
This work provides the first characterization of the existence of one-way permutations based on a complexity-class separation and shows that their existence is equivalent to a number of previously studied complexity-theoretic hypotheses.
A New Cryptosystem Based On Hidden Order Groups
  • A. Saxena, B. Soh
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2006
This work exploits a ``gap'' to construct a cryptosystem based on hidden order groups and presents a practical implementation of a novel cryptographic primitive called an \emph{Oracle Strong Associative One-Way Function} (O-SAOWF).
The cryptographic impact of groups with infeasible inversion
The necessary mathematical criteria for a secure transitive signature scheme when the signatures can be composed in any order are formalized, showing that the edge signatures in such a scheme form a special (and powerful) mathematical group not known to exist: an Abelian trapdoor group with infeasible inversion (ATGII).
Double Blind Comparisons using Groups with Infeasible Inversion
This paper shows how Double Blind Comparisons can be implemented using a Strong Associative One-Way Function (SAOWF), making an additional assumption that the SAOWF is implemented on a Group with Infeasible Inversion (GII).
Some facets of complexity theory and cryptography: A five-lecture tutorial
  • J. Rothe
  • Computer Science, Mathematics
  • 2002
This tutorial discusses the notion of one-way functions both in a cryptographic and in a complexity-theoretic setting, and considers interactive proof systems and some interesting zero-knowledge protocols.
Statement of Authorship
I hereby declare that this submission entitled “Frontline Employee Adaptability: Conceptualization, Measurement, Antecedents and Consequences” is my own work carried out under the supervision of
The Complexity Theory Companion
To more clearly highlight the role of algorithmic techniques in complexity theory, this book is organized by technique rather than by topic, and its technique-based approach more vividly conveys to the reader the flavor and excitement of such conflagrations.


Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory
It is proved that if P?NP then strong, total, commutative, associative one-way functions exist.
On Some Natural Complete Operators
  • K. Ko
  • Mathematics
    Theor. Comput. Sci.
  • 1985
The Complexity of Sparse Sets in P
  • E. Allender
  • Computer Science, Mathematics
    Computational Complexity Conference
  • 1986
The complexity of sparse sets in P is shown to be central to certain questions about circuit complexity classes and about one-way functions.
P-Printable Sets
It is shown that the class of sets of small generalized Kolmogorov complexity is exactly theclass of sets which are P-isomorphic to a tally language.
Complexity Measures for Public-Key Cryptosystems
A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two related approaches are taken to the development of this theory, and th...
Relative Complexity of Checking and Evaluating
  • L. Valiant
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 1976