International Conference on Computational Intelligence and Security (CIS)

A Two-Party Certificateless Authenticated Key Agreement Protocol with Provable Security

Guiying Li, Hou Mengbo, Chuan Zhao, Qiuliang Xu

Published Dec 1, 2013• 2 citations

Abstract

In this paper we propose a two-party certificate less authenticated key agreement scheme which has proven to be secure in the random oracle model. The new protocol is secure as long as each party has at least one uncompromised secret. In addition, the new protocol has higher efficiency than several other strongly secure key agreement protocols(such as Lippold[2], protocol[3], protocol[4]).

DOI: 10.1109/cis.2013.124

Related papers

Certificateless two-party key agreement scheme without bilinear pairing

XU Chun-xiang

A few of certificateless key agreement schemes have been proposed in recent years,all of them need pairing operations,what's more,most of them are vulnerable to the key compromise impersonation attack and resistance to leakage of ephemeral keys.The provably secure certificateless key agreement protocol was proposed by Lippold in 2009,but their protocol suffered from computation burden.In order to solve the above-mentioned problem,this paper proposed a new pairing-free certificateless two party key agreement scheme (CL-KA) and presened its security properties.The new scheme was secure as long as each party had at least one uncompromised secret.Thus,the new scheme was secure even if the key generation centre learned the ephemeral secrets of both parties.The new scheme achieves efficiency in computational cost when compared with Lippold's protocol.

Jisuanji yingyong yanjiuJan 1, 20103 citations

Practical Certificateless Authenticated Two-party Key Protocol

Jian Shu

Recently,Lippold et al.proposed certificateless authenticated two-party key agreement with provable security,their scheme suffers from computation burden.Basesd on twin diffie-hellman problem introduced by Cash,Kiltz and Shoup,A new scheme using bilinear pair is proposed.When compared with Lippold's scheme,the proposed protocol,with the same message bandwidth,achieves efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model under CDH assumption and BDH assumption.

Journal of Chinese Computer SystemsJan 1, 20100 citations

Two Party Certificateless Key Agreement Schemes

Liu Wen

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.

Jan 1, 20110 citations

Constructing certificateless-based two-party authenticated key agreement protocol

Han Jiang

The certificateless -based authenticated key agreement protocols have the advantages of simplicity of managing identities compared to the PKI-based schemes,as well as avoiding the key escrow issues inherited in the identity-based schemes. This paper proposes a two-party certificateless-based authenticated key agreement scheme based on a provably secure certificateless-based public key encryption scheme.The comparisons with other comparable schemes in security and efficiency show that,the new scheme achieves more of the desired security attributes,such as perfect forward secrecy,PKG forward secrecy,known session-specific temporary information secrecy and key escrowless.Meanwhile it keeps the nice computational efficiency.

Computer Engineering and Applications JournalJan 1, 20100 citations

Certificateless key agreement scheme under manufacturing grid

XU Chun-xiang

Currently,certificate management is a complex problem in grid technology.To solve this problem,a novel certificateless two-party key agreement scheme was proposed.This scheme achieved explicit authentication,so its security under random oracle model was verified.It was secure as long as each party had at least one uncompromised secret.This new scheme was apt for the manufacturing grid environment under the multiple trust-fields.Compared with other key agreement protocols under manufacturing grid,the new scheme was more efficient in computing.

Jan 1, 20110 citations

Certificateless Two Party Key Agreement Protocol

Wenhao Liu, Chunxiang Xu, Jian Feng Xu

Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. The provably secure certificateless key agreement protocol is proposed by Lippold et al. in 2009, but their protocol suffers from computation burden. Owing to the above-mentioned situations, a new certificateless two party key agreement protocol (CL-KA) is proposed and the security attributes are analyzed in the extended Canetti-Krawzcyk(eCK) security model. Our protocol only requires each entity to compute two pairings, up to now, it turns out to be the most efficient one of all the previously known security CL-KA schemes.

International Conference on Multimedia Information Networking and SecurityJan 1, 20103 citations