Low Ambiguity in Strong, Total, Associative, One-Way Functions

Details Low Ambiguity in Strong, Total, Associative, One-Way Functions Low Ambiguity in Strong, Total, Associative, One-Way Functions

2000-10-02

arxiv.org/abs/cs/0010005v1

Computer Science

Computational Complexity

18 pages, one tex file, one bbl file

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Low Ambiguity in Strong, Total, Associative, One-Way Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Low Ambiguity in Strong, Total, Associative, One-Way Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low Ambiguity in Strong, Total, Associative, One-Way Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-530783