中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Subject: Computer Science
Title:
an id-based authenticated dynamic group key agreement with optimal round
Author: Teng JiKai ; Wu ChuanKun ; Tang ChunMing
Keyword: identity-based cryptography ; dynamic group key agreement ; provably secure ; admissible pairing
Source: SCIENCE CHINA-INFORMATION SCIENCES
Issued Date: 2012
Volume: 55, Issue:11, Pages:2542-2554
Indexed Type: SCI
Department: Teng JiKai; Wu ChuanKun Chinese Acad Sci Inst Software State Key Lab Informat Secur Beijing 100090 Peoples R China. Teng JiKai Chinese Acad Sci Grad Univ Beijing 100049 Peoples R China. Tang ChunMing Guangzhou Univ Fac Math & Informat Sci Guangzhou 510006 Guangdong Peoples R China.
Sponsorship: National High-Tech Research & Development Program of China 2009AA-01Z414; National Natural Science Foundation of China 60903210, 10871222; Chinese Academic of Sciences YYYJ-1013
Abstract: Group key agreement protocols are crucial for achieving secure group communications. They are designed to provide a set of users with a shared secret key to achieve cryptographic goal over a public network. When group membership changes, the session key should be refreshed efficiently and securely. Most previous group key agreement protocols need at least two rounds to establish or refresh session keys. In this paper, a dynamic authenticated group key agreement (DAGKA) protocol based on identity-based cryptography is presented. By making use of the members' values stored in previous sessions, our Join and Leave algorithms reduce the computation and communication costs of members. In the proposed protocol, Setup and Join algorithms need one round. The session key can be refreshed without message exchange among remaining users in Leave algorithm, which makes the protocol more practical. Its security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption in random oracle model.
English Abstract: Group key agreement protocols are crucial for achieving secure group communications. They are designed to provide a set of users with a shared secret key to achieve cryptographic goal over a public network. When group membership changes, the session key should be refreshed efficiently and securely. Most previous group key agreement protocols need at least two rounds to establish or refresh session keys. In this paper, a dynamic authenticated group key agreement (DAGKA) protocol based on identity-based cryptography is presented. By making use of the members' values stored in previous sessions, our Join and Leave algorithms reduce the computation and communication costs of members. In the proposed protocol, Setup and Join algorithms need one round. The session key can be refreshed without message exchange among remaining users in Leave algorithm, which makes the protocol more practical. Its security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption in random oracle model.
Language: 英语
WOS ID: WOS:000310226800012
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15053
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Teng JiKai,Wu ChuanKun,Tang ChunMing. an id-based authenticated dynamic group key agreement with optimal round[J]. SCIENCE CHINA-INFORMATION SCIENCES,2012-01-01,55(11):2542-2554.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Teng JiKai]'s Articles
[Wu ChuanKun]'s Articles
[Tang ChunMing]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Teng JiKai]‘s Articles
[Wu ChuanKun]‘s Articles
[Tang ChunMing]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace