Sciweavers

23 search results - page 2 / 5
» On reusing ephemeral keys in Diffie-Hellman key agreement pr...
Sort
View
SCN
2010
Springer
232views Communications» more  SCN 2010»
13 years 2 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena
AINA
2005
IEEE
13 years 10 months ago
Secure One-Round Tripartite Authenticated Key Agreement Protocol from Weil Pairing
In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on ...
Chu-Hsing Lin, Hsiu-Hsia Lin
CCR
1999
92views more  CCR 1999»
13 years 4 months ago
A fair certification protocol
In this paper a `fair' key generation and certification protocol for Diffie-Hellman keys is proposed, which is intended for use in cases where neither User nor CA are trusted...
Chris J. Mitchell, Konstantinos Rantos
ISCI
2010
146views more  ISCI 2010»
13 years 2 months ago
Simulatable certificateless two-party authenticated key agreement protocol
Key agreement (KA) allows two or more users to negotiate a secret session key among them over an open network. Authenticated key agreement (AKA) is a KA protocol enhanced to preve...
Lei Zhang 0009, Futai Zhang, Qianhong Wu, Josep Do...
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
13 years 8 months ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu