题名: a new two-round certificateless authenticated key agreement protocol without bilinear pairings
作者: He Debiao
; Chen Yitao
; Chen Jianhua
; Zhang Rui
; Han Weiwei
刊名: Mathematical and Computer Modelling
发表日期: 2011
卷: 54, 期: 11-12, 页: 3143-3152 收录类别: ei
部门归属: (1) School of Mathematics and Statistics, Wuhan University, Wuhan, China; (2) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) School of Mathematics and Computer Science, Guangdong University of Business Studies, Guangzhou, China
英文摘要: Certificateless public key cryptography (CLPKC), which can simplify the complex certificate management in the traditional public key cryptography and resolve the key escrow problem in identity-based cryptography, has been widely studied. As an important part of CLPKC, certificateless two-party authenticated key agreement (CTAKA) protocols have also received considerable attention. Recently, many CTAKA protocols using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group. To improve the performance, several CTAKA protocols without pairings have been proposed. In this paper, we will show a latest CTAKA protocol is not secure against a type 1 adversary. To improve the security and performance, we also propose a new CTAKA protocol without pairing. At last, we show the proposed protocol is secure under the random oracle model. © 2011. 语种: 英语
WOS记录号: WOS:000295716700058
Citation statistics:
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/14089
Appears in Collections: 软件所图书馆_期刊论文
File Name/ File Size
Content Type
Version
Access
License
A new two-round certificateless authenticated key agreement protocol without bilinear pairings.pdf （303KB） -- -- 限制开放 -- 联系获取全文
Recommended Citation:
He Debiao,Chen Yitao,Chen Jianhua,et al. a new two-round certificateless authenticated key agreement protocol without bilinear pairings[J]. Mathematical and Computer Modelling,2011-01-01,54(11-12):3143-3152.
