Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2008
Springer

favoriteEmaildiscussreport

122views Education» more CORR 2008»

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

13 years 4 months ago

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

Download eprint.iacr.org

In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a random permutation oracle n times. We prove that Eve can always break the protocol by querying the oracle O(n2 ) times. The long-time unproven optimality of the quadratic bound in the fully general, multi-round scenario has been proven recently by Barak and MahmoodyGhidary. The results in this paper have been found independently of their work.

Miroslava Sotáková

Real-time Traffic

CORR 2008 | Education | One-round Key-agreement Protocols | Random Oracle Model | Random Permutation Oracle |

claim paper

Related Content

» Key Agreement Protocols and Their Security Analysis

» OneRound Protocols for TwoParty Authenticated Key Exchange

» Efficient OneRound Key Exchange in the Standard Model

» RoundEfficient Conference Key Agreement Protocols with Provable Security

» StronglySecure IdentityBased Key Agreement and Anonymous Extension

» Authenticated Key Agreement with Key Reuse in the Short Authenticated Strings Model

» Security arguments for the UM key agreement protocol in the NIST SP 80056A standard

» A New Security Model for Authenticated Key Agreement

» Passwordbased Encrypted Group Key Agreement

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Miroslava Sotáková

Comments (0)