Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function
| dc.creator | Hemaspaandra, Lane A. | |
| dc.creator | Rothe, Joerg | |
| dc.date | 1998-08-23 | |
| dc.date.accessioned | 2026-07-07T03:23:28Z | |
| dc.date.available | 2026-07-07T03:23:28Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/9808003 | |
| dc.identifier | http://arxiv.org/abs/cs/9808003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32953 | |
| dc.subject | Computational Complexity | |
| dc.subject | Cryptography and Security | |
| dc.subject | F.1.3; E.3 | |
| dc.title | Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function | |
| dc.type | text |