Low Ambiguity in Strong, Total, Associative, One-Way Functions
| dc.creator | Homan, Christopher M. | |
| dc.date | 2000-10-02 | |
| dc.date.accessioned | 2026-07-07T03:16:36Z | |
| dc.date.available | 2026-07-07T03:16:36Z | |
| dc.description | Rabi and Sherman present a cryptographic paradigm based on associative, one-way functions that are strong (i.e., hard to invert even if one of their arguments is given) and total. Hemaspaandra and Rothe proved that such powerful one-way functions exist exactly if (standard) one-way functions exist, thus showing that the associative one-way function approach is as plausible as previous approaches. In the present paper, we study the degree of ambiguity of one-way functions. Rabiand Sherman showed that no associative one-way function (over a universe having at least two elements) can be unambiguous (i.e., one-to-one). Nonetheless, we prove that if standard, unambiguous, one-way functions exist, then there exist strong, total, associative, one-way functions that are $\mathcal{O}(n)$-to-one. This puts a reasonable upper bound on the ambiguity. | |
| dc.description | 18 pages, one tex file, one bbl file | |
| dc.identifier | https://arxiv.org/abs/cs/0010005 | |
| dc.identifier | http://arxiv.org/abs/cs/0010005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30412 | |
| dc.subject | Computational Complexity | |
| dc.subject | f.1.3 | |
| dc.title | Low Ambiguity in Strong, Total, Associative, One-Way Functions | |
| dc.type | text |