Institutional Repository
| an id-based authenticated dynamic group key agreement with optimal round | |
| Teng JiKai; Wu ChuanKun; Tang ChunMing | |
| 2012 | |
| Source | SCIENCE CHINA-INFORMATION SCIENCES
 |
| ISSN | 1674-733X |
| Volume | 55Issue:11Pages:2542-2554 |
| 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.; 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. |
| Indexed Type | SCI |
| Keyword | Identity-based Cryptography Dynamic Group Key Agreement Provably Secure Admissible Pairing |
| 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. |
| Subject | Computer Science |
| 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 |
| Language | 英语 |
| WOS ID | WOS:000310226800012 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15053 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment