Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function

Details Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function

1998-08-23

arxiv.org/abs/cs/9808003v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function 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 Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-24546