Sciweavers

20 search results - page 1 / 4
» Breaking One-Round Key-Agreement Protocols in the Random Ora...
Sort
View
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 4 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
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 rando...
Miroslava Sotáková
IMA
1997
Springer
211views Cryptology» more  IMA 1997»
13 years 8 months ago
Key Agreement Protocols and Their Security Analysis
This paper proposes new protocols for two goals: authenticated key agreement and authenticated key agreement with key con rmation in the asymmetric public-key setting. A formalm...
Simon Blake-Wilson, Don Johnson, Alfred Menezes
ACNS
2004
Springer
156views Cryptology» more  ACNS 2004»
13 years 9 months ago
One-Round Protocols for Two-Party Authenticated Key Exchange
Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channe...
Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee
ACISP
2008
Springer
13 years 6 months ago
Efficient One-Round Key Exchange in the Standard Model
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
Colin Boyd, Yvonne Cliff, Juan Manuel Gonzá...
ASIACRYPT
2000
Springer
13 years 8 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng