A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

被引：230

作者：

Cao, Xuefei ^{[1
]}

Kou, Weidong ^{[2
]}

Du, Xiaoni ^{[3
]}

机构：

[1] Duke Univ, Dept Comp Sci, Durham, NC 27706 USA

[2] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China

[3] NW Normal Univ, Coll Math & Informat Sci, Lanzhou, Peoples R China

来源：

INFORMATION SCIENCES | 2010年 / 180卷 / 15期

关键词：

Identity-based; Authenticated key agreement; Elliptic curve; Bilinear pairing; Modular approach;

D O I：

10.1016/j.ins.2010.04.002

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Based on the computational Diffie-Hellman problem, this paper proposes an identity-based authenticated key agreement protocol which removes bilinear pairings. Compared with previous protocols, the new protocol minimizes message exchange time with no extra cost. The protocol provides strong security guarantees including key compromise impersonation resilience, perfect forward secrecy, and master key forward secrecy. A security proof with the modular approach in the modified Bellare-Rogaway model is also provided. Crown Copyright (C) 2010 Published by Elsevier Inc. All rights reserved.

引用

页码：2895 / 2903

页数：9

共 21 条

[1]

[Anonymous], 1993, CCS

[2]

[Anonymous], P 6 IMA INT C CRYPT

[3]

[Anonymous], P TOP CRYPT CT RSA

[4] Identity-based encryption from the Weil pairing [J].