One-Way Functions in Complexity Theory

We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply strong forms of these functions to achieve secret key agreement and digital signatures. Keywords. Associative one-way functions (AOWFs), computational complexity, cryptology, cryptography, cryptocomplexity, cryptographic protocols, digital signatures, key-agreement problem, secret-key exchange, theory of computation, public-key cryptography. Member, Institute for Advanced Computer Studies, University of Maryland College Park. 

• Type: Conference
• Year: 1990
• Where: MFCS
• Authors: Alan L. Selman
• Keywords: Associative One-way Functions, Digital Signatures, MFCS 1990, Secret Key Agreement, Theoretical Computer Science