Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Chinese Computer Systems

Practical Certificateless Authenticated Two-party Key Protocol

Jian Shu

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

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.

Related papers

Certificateless Two-party Authenticated Key Agreement Protocol With Provable Security

Jian Shu

This paper studies two-party authenticated agreement protocol in the certificateless public setting.Most of existing schemes either are proved insecure or have computation burden.Basesd on twin Diffie-Hellman problem introduced by Cash,Kiltz and Shoup,an efficient certificateless authenticated two-party key agreement protocol using bilinear pair is proposed.To construct an effective decision oracle for twin Diffie-Hellman problem,generic method of extracting partial private key is proposed.the method,with one master key and two hash functions.is applied to the design of protocol.When compared with other schemes with provable security,the proposed scheme,with the same message bandwidth,achieve efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model without Gap assumption.

Journal of Chinese Computer Systems•Jan 1, 2012•2 citations

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 yanjiu•Jan 1, 2010•3 citations

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

Guiying Li, Hou Mengbo, Chuan Zhao +1 more

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]).

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2013•2 citations

Certificateless One-Way Authenticated Two-Party Key Agreement Protocol

Wuping Chen, Lei Zhang, Bo Qin +2 more

Key agreement is one of the fundamental cryptographic primitives in public key cryptography. It plays an important role for securing systems in practice. In this paper, we present the first certificateless one-way authenticated two-party key agreement protocol. The security of the proposed protocol is analyzed based on the intractability of the standard discrete logarithm (DL) and bilinear Diffie-Hellman (BDH) problems. For efficiency, our protocol enjoys low complexity in both communication and computation.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•9 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, 2011•0 citations

An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem

Hai Huang, Zhenfu Cao

In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup. We show that our scheme is secure under bilinear Diffie-Hellman (BDH) assumption in the enhanced Canetti-Krawczyk (eCK) model, which better supports the adversary's queries than previous AKE models. To the best of our knowledge, our scheme is the first ID-based AKE protocol provably secure in eCK model.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Mar 10, 2009•78 citations
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.
This paper studies two-party authenticated agreement protocol in the certificateless public setting.Most of existing schemes either are proved insecure or have computation burden.Basesd on twin Diffie-Hellman problem introduced by Cash,Kiltz and Shoup,an efficient certificateless authenticated two-party key agreement protocol using bilinear pair is proposed.To construct an effective decision oracle for twin Diffie-Hellman problem,generic method of extracting partial private key is proposed.the method,with one master key and two hash functions.is applied to the design of protocol.When compared with other schemes with provable security,the proposed scheme,with the same message bandwidth,achieve efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model without Gap assumption.
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.
Key agreement is one of the fundamental cryptographic primitives in public key cryptography. It plays an important role for securing systems in practice. In this paper, we present the first certificateless one-way authenticated two-party key agreement protocol. The security of the proposed protocol is analyzed based on the intractability of the standard discrete logarithm (DL) and bilinear Diffie-Hellman (BDH) problems. For efficiency, our protocol enjoys low complexity in both communication and computation.
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.
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup. We show that our scheme is secure under bilinear Diffie-Hellman (BDH) assumption in the enhanced Canetti-Krawczyk (eCK) model, which better supports the adversary's queries than previous AKE models. To the best of our knowledge, our scheme is the first ID-based AKE protocol provably secure in eCK model.