Creating Strong Total Commutative Associative ComplexityTheoretic OneWay Functions from Any ComplexityTheoretic OneWay Function
Abstract
Rabi and Sherman [RS97] presented novel digital signature and unauthenticated secretkey agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use ``strong,'' total, commutative (in the case of multiparty secretkey agreement), associative oneway functions as their key building blocks. Though Rabi and Sherman did prove that associative oneway functions exist if $\p \neq \np$, they left as an open question whether any natural complexitytheoretic assumption is sufficient to ensure the existence of ``strong,'' total, commutative, associative oneway functions. In this paper, we prove that if $\p \neq \np$ then ``strong,'' total, commutative, associative oneway functions exist.
 Publication:

arXiv eprints
 Pub Date:
 August 1998
 DOI:
 10.48550/arXiv.cs/9808003
 arXiv:
 arXiv:cs/9808003
 Bibcode:
 1998cs........8003H
 Keywords:

 Computer Science  Computational Complexity;
 Computer Science  Cryptography and Security;
 F.1.3;
 E.3