Merkle Puzzles are Optimal

Details Merkle Puzzles are Optimal Merkle Puzzles are Optimal

2008-01-23

arxiv.org/abs/0801.3669v3

Computer Science

Computational Complexity

This version fixes a bug in the proof of the previous version of this paper, see "Correction of Error" paragraph and Appendix

Scientific paper

We prove that every key exchange protocol in the random oracle model in which the honest users make at most n queries to the oracle can be broken by an adversary making O(n^2) queries to the oracle. This improves on the previous Omega(n^6) query attack given by Impagliazzo and Rudich (STOC '89). Our bound is optimal up to a constant factor since Merkle (CACM '78) gave an n query key exchange protocol in this model that cannot be broken by an adversary making o(n^2) queries.

Affiliated with

Also associated with

No associations

Rating

Merkle Puzzles are Optimal 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 Merkle Puzzles are Optimal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Merkle Puzzles are Optimal will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-282721