An observation on associative one-way functions in complexity theory

DOI10.1016/S0020-0190(97)00186-5zbMath1339.68099OpenAlexW1965972287MaRDI QIDQ293135

Muhammad Rabi, Alan T. Sherman

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097001865?np=y

zbMATH Keywords

computational complexitycryptographypublic-key cryptographycryptologycryptographic protocolsdigital signaturesassociative one-way functions (AOWFs)cryptocomplexitykey-agreement problemsecret-key exchange

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

A cryptographic primitive based on hidden-order groups ⋮ Tight lower bounds on the ambiguity of strong, total, associative, one-way functions ⋮ Quantum one-way permutation over the finite field of two elements ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions ⋮ ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES ⋮ If P \(\neq\) NP then some strongly noninvertible functions are invertible ⋮ Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory

Cites Work

• Is the data encryption standard a group? (Results of cycling experiments on DES)
• Diffie-Hellman Oracles
• Complexity Measures for Public-Key Cryptosystems
• New directions in cryptography
• A conference key distribution system
• A survey of one-way functions in complexity theory
• A note on the complexity of cryptography (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An observation on associative one-way functions in complexity theory