Identify-Based Authenticated Key Agreement Protocols without Bilinear Pairings

被引:25
作者
Cao, Xuefei [1 ]
Kou, Weidong [1 ]
Yu, Yong [2 ]
Sun, Rong [1 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Engn & Comp Sci, Chengdu 610054, Peoples R China
关键词
identify-based cryptography; authenticated key agreement; bilinear pairing; elliptic durve;
D O I
10.1093/ietfec/e91-a.12.3833
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This letter proposes in identity-based authenticated key agreement protocol. Different from available comparable ones, the new protocol realizes implicit authentication without bilinear pairings which makes it more efficient. The security of proposed protocol can be reduced to the standard Computational Diffie-Hellman problem. Two variants of the protocol are also given, with one achieving the security-efficiency trade-off and the other providing authenticated key agreement between users of different domains.
引用
收藏
页码:3833 / 3836
页数:4
相关论文
共 8 条
[1]  
Bao F, 2003, LECT NOTES COMPUT SC, V2836, P301
[2]  
Blake-Wilson S, 1997, LECT NOTES COMPUT SC, V1355, P30, DOI 10.1007/BFb0024447
[3]  
BONEH D, 2001, LNCS, V2139
[4]   Identity-based key agreement protocols from pairings [J].
Chen, L. ;
Cheng, Z. ;
Smart, N. P. .
INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2007, 6 (04) :213-241
[5]  
McCullagh N, 2005, LECT NOTES COMPUT SC, V3376, P262
[6]  
Sakai R., 2000, 2000 S CRYPT INF SEC
[7]  
SHAMIR A, 1984, LNCS, V1984, P47
[8]   An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices [J].
Zhu, Robert W. ;
Yang, Guomin ;
Wong, Duncan S. .
THEORETICAL COMPUTER SCIENCE, 2007, 378 (02) :198-207