Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory

DOI10.1006/jcss.1998.1613zbMath0939.68036OpenAlexW2091109792MaRDI QIDQ1307703

Jörg Rothe, Hemaspaandra, Lane A.

Publication date: 27 June 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4f51e5b245864247afab28bf4988588e64004859

zbMATH Keywords

digital signaturesecret-key agreement protocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)

Related Items (11)

Transmutation scheme of coin flipping protocol and utilization ⋮ 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 ⋮ ON THE CIRCUIT-SIZE OF INVERSES ⋮ 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 ⋮ On a family of preimage-resistant functions ⋮ Characterizing the existence of one-way permutations ⋮ On characterizing the existence of partial one-way permutations

Cites Work

• Unnamed Item
• Unnamed Item
• An observation on associative one-way functions in complexity theory
• On some natural complete operators
• Relative complexity of checking and evaluating
• Complexity Measures for Public-Key Cryptosystems
• New directions in cryptography
• A survey of one-way functions in complexity theory

This page was built for publication: Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory