An efficient protocol for authenticated key agreement

被引:290
作者
Law, L
Menezes, A
Qu, MH
Solinas, J
Vanstone, S
机构
[1] Natl Secur Agcy, Ft George G Meade, MD 20755 USA
[2] Univ Waterloo, Dept C&O, Waterloo, ON N2L 3G1, Canada
[3] Certicom Res, Mississauga, ON L4W 5L1, Canada
关键词
Diffie-Hellman; authenticated key agreement; key confirmation; elliptic curves;
D O I
10.1023/A:1022595222606
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes an efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting. The protocol is based on Diffie-Hellman key agreement and can be modified to work in an arbitrary finite group and, in particular, elliptic curve groups. Two modifications of this protocol are also presented: a one-pass authenticated key agreement protocol suitable for environments where only one entity is on-line, and a three-pass protocol in which key confirmation is additionally provided. Variants of these protocols have been standardized in IEEE P1363 [17], ANSI X9.42 [2], ANSI X9.63 [4] and ISO 15496-3 [18], and are currently under consideration for standardization and by the U. S. government's National Institute for Standards and Technology [30].
引用
收藏
页码:119 / 134
页数:16
相关论文
共 40 条
[1]  
ANDERSON R, 1996, LNCS, V1163, P26
[2]  
[Anonymous], LNCS
[3]  
[Anonymous], 1998, P 30 ANN ACM S THEOR
[4]  
ANSI, 2001, X963 ANSI
[5]  
*ANSI, 2001, X942 ANSI
[6]  
*ANSI, 1999, X962 ANSI ECDSA
[7]  
Bellare M, 1996, LNCS, V1109, P1
[8]  
Bellare M, 1994, LECT NOTES COMPUTER, V773, P232, DOI DOI 10.1007/3-540-48329-2
[9]  
Blake-Wilson S, 1997, LECT NOTES COMPUT SC, V1355, P30, DOI 10.1007/BFb0024447
[10]  
BURMESTER M, 1994, LNCS, V839, P308