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 Sichuan University

Strongly Secure Certificateless Authenticated Key Agreement Protocol in Standard Model

Ming Chen

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

Based on Zhang's security model,an improved pairing-free certificateless key agreement,CL-AKA random oracle model,was proposed.An ephemeral-secret query and three types of fresh oracles were further defined in the improved CL-AKA random oracle model to achieve the simulation of key-compromise impersonation,disclosure of ephemeral secrets and perfect forward secrecy.A CL-AKA protocol with strong security was proposed,costing only 9 scalar multiplications on the elliptic curve.The secure of the new protocol was proved in the improved model.The comparative analysis pointed out that the new protocol with strong security and low computing costs can be used to build secure mobile communication environment.

Related papers

Strongly Secure Certificateless Authenticated Key Agreement Protocol in Standard Model

Yanhong Zhang, Ming CHEN

Abstract:Based on Zhang’s security model, an improved pairing-free certificateless key agreement,CL-AKA random oracle model, was proposed. An ephemeral-secret query and three types of fresh oracles were further defined in the improved CL-AKA random oracle model to achieve the simulation of key-compromise impersonation, disclosure of ephemeral secrets and perfect forward secrecy. A CL-AKA protocol with strong security was proposed, costing only 9 scalar multiplications on the elliptic curve. The secure of the new protocol was proved in the improved model. The comparative analysis pointed out that the new protocol with strong security and low computing costs can be used to build secure mobile communication environment.

•Jan 1, 2013•0 citations

Provably Secure Certificateless Authenticated Key Agreement Protocol in the Standard Model

Xiaofen Wang, Xiongda Li

Inspired by the certificateless public key encryption scheme proposed by Jong et al, we present a new certificateless authenticated key agreement protocol (CLAK). It is provably secure in the standard model. CLAK protocol provides perfect forward secrecy. Compared with a certificateless authenticated key agreement protocol which is only provable secure in the random oracle model, the new protocol is improved with respect to the security properties, computation and communication cost.

International Conference on Pervasive Computing, Signal Processing and Applications (PCSPA)•Sep 1, 2010•0 citations

An Improved secure certificateless authenticated group key agreement protocol

Manman Geng, Futai Zhang

In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.

IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS)•Nov 1, 2009•1 citation

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

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

Certificateless Authenticated Key Agreement Protocol against KCI and KRA

Hongtu Li, Liang Qing Hu, Wei Yuan +1 more

In an open and distributed environment, authenticated key agreement protocol, as an important cryptographic primitive, is used to authenticate entities and establish session key in order to provide secure communications. Certificateless public key cryptography (CL-PKC) combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we propose a new protocol based on CL-PKC. The new proposed protocol achieves most of the required security attributes. Security analysis shows that it achieves the attributes of forward secrecy, known-key secrecy, no-key control, key compromise impersonation and key replicating.

International Conference on Network Computing and Information Security•May 1, 2011•4 citations
Based on Zhang's security model,an improved pairing-free certificateless key agreement,CL-AKA random oracle model,was proposed.An ephemeral-secret query and three types of fresh oracles were further defined in the improved CL-AKA random oracle model to achieve the simulation of key-compromise impersonation,disclosure of ephemeral secrets and perfect forward secrecy.A CL-AKA protocol with strong security was proposed,costing only 9 scalar multiplications on the elliptic curve.The secure of the new protocol was proved in the improved model.The comparative analysis pointed out that the new protocol with strong security and low computing costs can be used to build secure mobile communication environment.
Abstract:Based on Zhang’s security model, an improved pairing-free certificateless key agreement,CL-AKA random oracle model, was proposed. An ephemeral-secret query and three types of fresh oracles were further defined in the improved CL-AKA random oracle model to achieve the simulation of key-compromise impersonation, disclosure of ephemeral secrets and perfect forward secrecy. A CL-AKA protocol with strong security was proposed, costing only 9 scalar multiplications on the elliptic curve. The secure of the new protocol was proved in the improved model. The comparative analysis pointed out that the new protocol with strong security and low computing costs can be used to build secure mobile communication environment.
In modern collaborative and distributed applications, authenticated group key agreement (AGKA) is one of the important issues. In this paper, we present that one existing certificateless AGKA protocol has some security drawbacks and does not satisfy some security attributes required for AGKA protocols. To overcome its drawbacks, we propose a secure and efficient protocol upon the initial one and a signature scheme proved secure in the random oracle model. The security analysis shows that our improved protocol can achieve Explicit key authentication, Known session key security, Known ephemeral secrets security, Perfect forward security, No key compromise impersonation, No key control and No unknown key share. With respect to efficiency, our protocol only needs three communication rounds. In each protocol run, only three pairing computations are involved for each participant.
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.
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 an open and distributed environment, authenticated key agreement protocol, as an important cryptographic primitive, is used to authenticate entities and establish session key in order to provide secure communications. Certificateless public key cryptography (CL-PKC) combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we propose a new protocol based on CL-PKC. The new proposed protocol achieves most of the required security attributes. Security analysis shows that it achieves the attributes of forward secrecy, known-key secrecy, no-key control, key compromise impersonation and key replicating.