Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function
<|reference_start|>Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function: Rabi and Sherman [RS97] presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use ``strong,'' total, commutative (in the case of multi-party secret-key agreement), associative one-way functions as their key building blocks. Though Rabi and Sherman did prove that associative one-way functions exist if $\p \neq \np$, they left as an open question whether any natural complexity-theoretic assumption is sufficient to ensure the existence of ``strong,'' total, commutative, associative one-way functions. In this paper, we prove that if $\p \neq \np$ then ``strong,'' total, commutative, associative one-way functions exist.<|reference_end|>
@article{hemaspaandra1998creating,
    title={Creating Strong Total Commutative Associative Complexity-Theoretic
  One-Way Functions from Any Complexity-Theoretic One-Way Function},
    author={Lane A. Hemaspaandra and Joerg Rothe},
    journal={arXiv preprint arXiv:cs/9808003},
    year={1998},
    number={see UR-CS-TR-98-688},
    archivePrefix={arXiv},
    eprint={cs/9808003},
    primaryClass={cs.CC cs.CR}
}