Breaking One-Round Key-Agreement Protocols in the Random Oracle Model

Details Breaking One-Round Key-Agreement Protocols in the Random Oracle Model Breaking One-Round Key-Agreement Protocols in the Random Oracle Model

2008-01-30

arxiv.org/abs/0801.4714v3

Computer Science

Computational Complexity

6 pages

Scientific paper

In this paper we study one-round key-agreement protocols analogous to Merkle's puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutation oracle $n$ times and upon their queries and communication, they both output the same key with high probability. We prove that Eve can always break such a protocol by querying the oracle $O(n^2)$ times. The long-time unproven optimality of the quadratic bound in the fully general, multi-round scenario has been shown recently by Barak and Mahmoody-Ghidary. The results in this paper have been found independently of their work.

Affiliated with

Also associated with

No associations

Rating

Breaking One-Round Key-Agreement Protocols in the Random Oracle Model 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 Breaking One-Round Key-Agreement Protocols in the Random Oracle Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Breaking One-Round Key-Agreement Protocols in the Random Oracle Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122155