| Efficient Authenticated Key Agreement Protocol Using Self-Certified Public Keys from Pairings |
| |
| 引用本文： | SHAOZu-hua. Efficient Authenticated Key Agreement Protocol Using Self-Certified Public Keys from Pairings[J]. 武汉大学学报:自然科学英文版, 2005, 10(1): 267-270. DOI: 10.1007/BF02828666 |
| |
| 作者姓名： | SHAOZu-hua |
| |
| 作者单位： | DepartmentofComputerandElectronicEngineering,ZhejiangUniversityof~e-,cienceandTechnology,Hangzhou310012,Zhejiang,China |
| |
| 基金项目： | SupportedbyScientificResearchFoundationofZhejiangProvincialEducationDepartment(20030840) |
| |
| 摘 要： | An efficient authenticated key agreement protocol is proposed, which makes use of bilinear pairings and selfcertified public keys. Its security is based on the security assumptions of the bilinear Diffie-Hellman problem and the computational Diffic-Hellman problem. Users can choose their private keys independently. The public keys and identities of users can bc verified implicitly when the session key being generating in a logically single step. A trusted Key Generation Center is no longer required as in the ID-based authenticated key agreement protocols. Compared with existing authenticated key agreement protocols from pairings, the new proposed protocol is more efficient and secure.
|
| 关 键 词： | 鉴定密钥一致性协议 自鉴定公钥 信息安全 私钥 双线性对偶 |
| 收稿时间： | 2004-05-10 |
Efficient authenticated key agreement protocol using self-certified public keys from pairings |
| |
| Shao Zu-hua. Efficient authenticated key agreement protocol using self-certified public keys from pairings[J]. Wuhan University Journal of Natural Sciences, 2005, 10(1): 267-270. DOI: 10.1007/BF02828666 |
| |
| Authors: | Shao Zu-hua |
| |
| Affiliation: | (1) Department of Computer and Electronic Engineering, Zhejiang University of Science and Technology, 310012 Hangzhou Zheijiang, China |
| |
| Abstract: | An efficient authenticated key agreement protocol is proposed,which makes use of bilinear pairings and self-certified public keys. Its security is based on the security assumptions of the bilinear Diffie-Hellman problem and the computational Diffie-Hellman problem. Users can choose their private keys independently. The public keys and identities of users can be verified implicitly when the session key being generating in a logically single step. A trusted Key Generation Center is no longer required as in the ID-based authenticated key agreement protocols. Compared with existing authenticated key agreement protocols from pairings, the new proposed protocol is more efficient and secure. |
| |
| Keywords: | authenticated key agreement protocol self-certified public keys bilinear pairings |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
