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

Frontiers of Computer Science

A novel pairing-free certificateless authenticated key agreement protocol with provable security

Haiyan Haiyan, Sun Sun, Qiaoyan, Wen Wen, Hua Hua, Zhang, Zhengping, Jin

Published Jan 1, 2013• 1 citation
OpenAlex

Abstract

最近，他等。(有应用程序的计算机和数学， 2012 ) 建议了一个有效没有对的无证书的证实的关键协议(CL 也称为) 协议并且宣称他们的协议在扩大 Canetti-Krawczyk (eCK ) 模型是 provably 安全的。由给具体攻击，我们显示他们的协议不在 eCK 模型是安全的。我们建议一个改进协议并且证明我们的改进在在差距 Diffie-Hellman (GDH ) 假设下面的 eCK 模型是安全的。而且，建议协议是很有效的。

Related papers

Provable Efficient Certificateless Group Key Exchange Protocol

Cao, Chunjie, Ma +3 more

无证书的公钥密码学(CL-PKC ) 避免固有的 escrowof 基于身份的密码学并且不要求证书保证真实性得到 ofpublic 钥匙。基于 CL-PKC，我们在场一把有效的经常回合的组钥匙交换协议，它在计算 Diffie-Hellman 的难驾驭下面是 provably 安全的问题。Ourprotocol 是有完美的前面的秘密的贡献关键交换并且有仅仅二 communicationrounds。它因此比另外的协议更有效。而且，我们的协议提供有效的经常回合的组钥匙交换协议和很秘密的分享计划 couldbe 采用了构造我们的协议的方法 todesign。

Wuhan University Journal of Natural Sciences•Jan 1, 2007•0 citations

A novel pairing-free certificateless authenticated key agreement protocol with provable security

Haiyan Sun, Qiaoyan Wen, Hua Zhang +1 more

Frontiers of Computer Science•Jul 2, 2013•29 citations

A Pairing-free Certificateless Authenticated Key Agreement Protocol in the eCK Model.

Debiao He, Sahadeo Padhye

•Jan 1, 2011•0 citations

Strongly Secure One Round Authenticated Key Exchange Protocol with Perfect Forward Security.

Hai Huang

Abstract. This paper investigates the two-pass authenticated key exchange protocol in the enhanced Canetti-Krawczyk (eCK) with perfect forward security. Currently, there exist no authenticated key exchange protocols which are provably secure in eCK model and meanwhile achieve perfect forward security against active adversary in one round. We propose a new two-pass authenticated key exchange protocol which enjoys following desirable properties. First, our protocol is shown secure in the eCK model under the gap Diffie-Hellman (GDH) assumption. Moreover, our protocol does not use the NAXOS transformation, the drawback of which will be discussed in the introduction. Second, under the same assumption, we prove that our protocol achieves perfect forward security against active adversary in one round. To the best of our knowledge, our proposal is first two-pass (one round) AKE protocol provably secure in the eCK model and achieving perfect forward security against active adversary.

•Jan 1, 2011•0 citations

Strongly secure certificateless one-pass authenticated key agreement scheme

Baojun Huang, Hang Tu

As certificateless public key cryptography (CLPKC) could solve the problem of keyescrow, recently it has been studied more and more. Certificateless authenticated keyagreement (CLAKA), as an important part of the CLPKC, also attracts considerableattention. So far, many kinds of provably secure one-pass CLAKA schemes have beenproposed. However, only few of them are given security proof in a formal model.In this paper, we propose a novel one-pass CLAKA scheme and demonstrate that itis provably secure under the gap bilinear computational Diffie-Hellman (GBCDH)assumption and the Gap Computational Diffie-Hellman (GCDH) assumption in theextended Canetti-Krawczyk (eCK) model. And as far as we know, our scheme is thefirst provably secure CLAKA scheme in the eCK model.

Kuwait Journal of Science•Feb 4, 2015•8 citations

Efficient Certificateless Authenticated Key Agreement Protocol from Pairings

Wang, Shengbao, Cao +2 more

在安全的网信息系统的区域，相互的认证和关键同意在网顾客和服务者之间是必要的。有效证书更少证实了关键协议协议因为网客户机 / 服务器设定被建议，它在某些椭圆形的曲线上使用白族戒指。我们证明最新建议的关键协议协议是实际的，同时，大效率，它为关键协议协议满足每个需要的安全要求。

Wuhan University Journal of Natural Sciences•Jan 1, 2006•22 citations
最近，他等。(有应用程序的计算机和数学， 2012 ) 建议了一个有效没有对的无证书的证实的关键协议(CL 也称为) 协议并且宣称他们的协议在扩大 Canetti-Krawczyk (eCK ) 模型是 provably 安全的。由给具体攻击，我们显示他们的协议不在 eCK 模型是安全的。我们建议一个改进协议并且证明我们的改进在在差距 Diffie-Hellman (GDH ) 假设下面的 eCK 模型是安全的。而且，建议协议是很有效的。
无证书的公钥密码学(CL-PKC ) 避免固有的 escrowof 基于身份的密码学并且不要求证书保证真实性得到 ofpublic 钥匙。基于 CL-PKC，我们在场一把有效的经常回合的组钥匙交换协议，它在计算 Diffie-Hellman 的难驾驭下面是 provably 安全的问题。Ourprotocol 是有完美的前面的秘密的贡献关键交换并且有仅仅二 communicationrounds。它因此比另外的协议更有效。而且，我们的协议提供有效的经常回合的组钥匙交换协议和很秘密的分享计划 couldbe 采用了构造我们的协议的方法 todesign。
Abstract. This paper investigates the two-pass authenticated key exchange protocol in the enhanced Canetti-Krawczyk (eCK) with perfect forward security. Currently, there exist no authenticated key exchange protocols which are provably secure in eCK model and meanwhile achieve perfect forward security against active adversary in one round. We propose a new two-pass authenticated key exchange protocol which enjoys following desirable properties. First, our protocol is shown secure in the eCK model under the gap Diffie-Hellman (GDH) assumption. Moreover, our protocol does not use the NAXOS transformation, the drawback of which will be discussed in the introduction. Second, under the same assumption, we prove that our protocol achieves perfect forward security against active adversary in one round. To the best of our knowledge, our proposal is first two-pass (one round) AKE protocol provably secure in the eCK model and achieving perfect forward security against active adversary.
As certificateless public key cryptography (CLPKC) could solve the problem of keyescrow, recently it has been studied more and more. Certificateless authenticated keyagreement (CLAKA), as an important part of the CLPKC, also attracts considerableattention. So far, many kinds of provably secure one-pass CLAKA schemes have beenproposed. However, only few of them are given security proof in a formal model.In this paper, we propose a novel one-pass CLAKA scheme and demonstrate that itis provably secure under the gap bilinear computational Diffie-Hellman (GBCDH)assumption and the Gap Computational Diffie-Hellman (GCDH) assumption in theextended Canetti-Krawczyk (eCK) model. And as far as we know, our scheme is thefirst provably secure CLAKA scheme in the eCK model.