an id-based authenticated dynamic group key agreement with optimal round
文献类型：期刊论文
| 作者 | Teng JiKai ; Wu ChuanKun ; Tang ChunMing |
| 刊名 | SCIENCE CHINA-INFORMATION SCIENCES
 |
| 出版日期 | 2012 |
| 卷号 | 55期号:11页码:2542-2554 |
| 关键词 | identity-based cryptography dynamic group key agreement provably secure admissible pairing |
| ISSN号 | 1674-733X |
| 中文摘要 | 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. |
| 英文摘要 | 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. |
| 学科主题 | Computer Science |
| 收录类别 | SCI |
| 资助信息 | National High-Tech Research & Development Program of China 2009AA-01Z414; National Natural Science Foundation of China 60903210, 10871222; Chinese Academic of Sciences YYYJ-1013 |
| 语种 | 英语 |
| WOS记录号 | WOS:000310226800012 |
| 公开日期 | 2013-09-17 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15053]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Teng JiKai,Wu ChuanKun,Tang ChunMing. an id-based authenticated dynamic group key agreement with optimal round[J]. SCIENCE CHINA-INFORMATION SCIENCES,2012,55(11):2542-2554. |
| APA | Teng JiKai,Wu ChuanKun,&Tang ChunMing.(2012).an id-based authenticated dynamic group key agreement with optimal round.SCIENCE CHINA-INFORMATION SCIENCES,55(11),2542-2554. |
| MLA | Teng JiKai,et al."an id-based authenticated dynamic group key agreement with optimal round".SCIENCE CHINA-INFORMATION SCIENCES 55.11(2012):2542-2554. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。