Two Party Certificateless Key Agreement Schemes
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A pairing-free certificateless two party key agreement scheme (CL-KA) is proposed. This work is able demonstrates all existing CL-KA schemes (except for Lippold’s scheme) are insecure in the eCK model. The scheme is secure in the eCK model as long as each party has at least one uncompromised secret. The scheme has proven to be secure in the random oracle model (ROM), assuming that the computational Diffie-Hellman assumption hold even if the key generation centre (KGC) learns the ephemeral secrets of both parties, or reveal secret values/replace public keys, but not both. The scheme eliminates pairing computation. It achieves efficiency in computational cost when compared with all the other known certificateless key agreement schemes. The scheme is more suitable for the restricted bandwidth of the communication environment, such as ad hoc networks, wireless sensors, and so on.

    Reference
    Related
    Cited by
Get Citation

刘文浩,许春香.无证书两方密钥协商方案.软件学报,2011,22(11):2843-2852

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 24,2010
  • Revised:August 13,2010
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063