| Provable Efficient Certificateless Group Key Exchange Protocol |
| |
| 作者姓名： | CAO Chunjie MA Jianfeng MOON Sangjae |
| |
| 作者单位： | [1]Key Laboratory of Computer Networks and InformationSecurity, Ministry of Education, Xidian University, Xi＇ an 710071,Shaanxi, China; [2]Mobile Network Security Technology Research Center,Kyungpook National University, Daeyu 702701, Korea |
| |
| 基金项目： | Foundation item： Supported by the National Natural Science Foundation of China （90204012, 60573035, 60573036） and the University IT Research Center Project of Korea |
| |
| 摘 要： | Certificateless public key cryptography （CL-PKC） avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.
|
| 关 键 词： | 计算机 元件 双线性 密码学 |
| 文章编号： | 1007-1202（2007）01-0041-05 |
| 收稿时间： | 2006-05-20 |
Provable efficient certificateless group key exchange protocol |
| |
| CAO Chunjie MA Jianfeng MOON Sangjae.Provable Efficient Certificateless Group Key Exchange Protocol[J].Wuhan University Journal of Natural Sciences,2007,12(1):41-45. |
| |
| Authors: | Cao Chunjie Ma Jianfeng Moon Sangjae |
| |
| Institution: | (1) Key Laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi’an, 710071, Shaanxi, China;(2) Mobile Network Security Technology Research Center, Kyungpook National University, Daeyu, 702701, Korea |
| |
| Abstract: | Certificateless public key cryptography (CL-PKC) avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our proto- col is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol. |
| |
| Keywords: | group key exchange certificateless public key cryptography provable security bilinear pairings |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
