ISCAS OpenIR
a provable authenticated certificateless group key agreement with constant rounds
Teng Jikai; Wu Chuankun
2012
发表期刊Journal of Communications and Networks
ISSN1229-2370
卷号14期号:1页码:104-110
摘要Group key agreement protocols allow a group of users, communicating over a public network, to establish a shared secret key to achieve a cryptographic goal. Protocols based on certificateless public key cryptography (CL-PKC) are preferred since CL-PKC does not need certificates to guarantee the authenticity of public keys and does not suffer from key escrow of identity-based cryptography. Most previous certificateless group key agreement protocols deploy signature schemes to achieve authentication and do not have constant rounds. No security model has been presented for group key agreement protocols based on CL-PKC. This paper presents a security model for a certificateless group key agreement protocol and proposes a constant-round group key agreement protocol based on CL-PKC. The proposed protocol does not involve any signature scheme, which increases the efficiency of the protocol. It is formally proven that the proposed protocol provides strong AKE-security and tolerates up to n - 2 malicious insiders for weak MA-security. The protocol also resists key control attack under a weak corruption model. © 2012 KICS.; Group key agreement protocols allow a group of users, communicating over a public network, to establish a shared secret key to achieve a cryptographic goal. Protocols based on certificateless public key cryptography (CL-PKC) are preferred since CL-PKC does not need certificates to guarantee the authenticity of public keys and does not suffer from key escrow of identity-based cryptography. Most previous certificateless group key agreement protocols deploy signature schemes to achieve authentication and do not have constant rounds. No security model has been presented for group key agreement protocols based on CL-PKC. This paper presents a security model for a certificateless group key agreement protocol and proposes a constant-round group key agreement protocol based on CL-PKC. The proposed protocol does not involve any signature scheme, which increases the efficiency of the protocol. It is formally proven that the proposed protocol provides strong AKE-security and tolerates up to n - 2 malicious insiders for weak MA-security. The protocol also resists key control attack under a weak corruption model. © 2012 KICS.
收录类别EI ; SCI
关键词Authentication Security Of Data
部门归属(1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) University of Chinese Academy of Sciences Beijing 100049 China
学科领域Computer Science ; Telecommunications
资助者National Science Foundation of China 60903210
语种英语
WOS记录号WOS:000301401500012
引用统计
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/14920
专题中国科学院软件研究所
推荐引用方式
GB/T 7714
Teng Jikai,Wu Chuankun. a provable authenticated certificateless group key agreement with constant rounds[J]. Journal of Communications and Networks,2012,14(1):104-110.
APA Teng Jikai,&Wu Chuankun.(2012).a provable authenticated certificateless group key agreement with constant rounds.Journal of Communications and Networks,14(1),104-110.
MLA Teng Jikai,et al."a provable authenticated certificateless group key agreement with constant rounds".Journal of Communications and Networks 14.1(2012):104-110.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Teng Jikai]的文章
[Wu Chuankun]的文章
百度学术
百度学术中相似的文章
[Teng Jikai]的文章
[Wu Chuankun]的文章
必应学术
必应学术中相似的文章
[Teng Jikai]的文章
[Wu Chuankun]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。