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

Concurrency and Computation Practice and Experience

An efficient protocol for two‐party explicit authenticated key agreement

Minghui Zheng, Huihua Zhou, Jing Chen

Published Dec 26, 2013• 11 citations
Publisher

Abstract

Summary Successful and efficient key management plays a critical role toward secured computing and communication systems. Many authenticated key agreement protocols have been proposed to meet the great challenges of information security. The two‐party key agreement protocol can be classified into two categories: implicit and explicit key authentications. This paper investigates the issue on authenticated two‐party key agreement protocol over an insecure public network and extends the existing implicit authenticated key agreement protocol into the explicit one by introducing the authenticators. The advantage of this explicit protocol is that it does not need any fixed public key infrastructure. Furthermore, this explicit protocol is provably secure in the random oracle under the Computation Gap Diffie‐Hellman assumption. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.

DOI
10.1002/cpe.3198

Related papers

Provably Secure Two-Party Explicit Authenticated Key Agreement Protocol

Minghui Zheng, Jing Chen

This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Jun 1, 2012•0 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

The design of authentication key protocol in certificate‐free public key cryptosystem

Yu‐Fang Chung

ABSTRACT In regard to the communication security of open networks, authenticated key management agreements are able to provide confidentiality, integrity, and verification so as to establish a more secure and fair digital rights management mechanism. For this reason, this paper, aiming at authentication key management agreements, tends to provide a security study on the application of authentication key management agreements, covering the establishment, analysis, design, security study, and performance optimization in various environments. Based on present public key schemes, such as public key cryptography, identity‐recognized cryptography, and undocumented cryptography, it aims to establish an authenticated key management agreement suitable for various application environments. Using the one‐way transmission in identity‐recognized cryptography or undocumented cryptography for formulating practical and effective security models, it tends to establish the one‐way authentication key agreement for both parties. Based on the design of single authentication key, an authentication key agreement for the undocumented public key cryptography is proposed to design a security model for the secure and high‐efficiency undocumented two‐party authentication key agreement. Under random oracle model and standard model, the security of the undocumented two‐party authentication key agreement is authenticated. Furthermore, aiming at the computational efficiency, communication efficiency, and key exchange frequency of group key management agreements, this paper aims to propose a method for dynamic membership. Besides, regarding the secure communication environment in different application backgrounds, such as the network applications of Grid, P2P, and ad‐hoc, it would propose practical group key agreements for networks and multi‐node communications to promote the security of group key management and to facilitate the computation of agreements and the optimization of communications. Copyright © 2013 John Wiley & Sons, Ltd.

Security and Communication Networks•Dec 10, 2013•5 citations

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

Cryptanalysis of an efficient certificateless two-party authenticated key agreement protocol.

Qingfeng Cheng

Abstract. Recently, He et al. (Computers and Mathematics with Applications, 2012, 64(6): 1914-1926) proposed a new efficient certificateless two-party authenticated key agreement protocol. They claimed their protocol was provably secure in the extended Canetti-Krawczyk (eCK) model. In this paper, we will show that their protocol is insecure. A type I adversary, who obtains one party’s ephemeral private key, can impersonate the party to cheat the other party and compute the shared session key successfully. For overcoming this weakness, we also propose a simple countermeasure.

•Jan 1, 2012•4 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
Summary Successful and efficient key management plays a critical role toward secured computing and communication systems. Many authenticated key agreement protocols have been proposed to meet the great challenges of information security. The two‐party key agreement protocol can be classified into two categories: implicit and explicit key authentications. This paper investigates the issue on authenticated two‐party key agreement protocol over an insecure public network and extends the existing implicit authenticated key agreement protocol into the explicit one by introducing the authenticators. The advantage of this explicit protocol is that it does not need any fixed public key infrastructure. Furthermore, this explicit protocol is provably secure in the random oracle under the Computation Gap Diffie‐Hellman assumption. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.
This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.
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.
ABSTRACT In regard to the communication security of open networks, authenticated key management agreements are able to provide confidentiality, integrity, and verification so as to establish a more secure and fair digital rights management mechanism. For this reason, this paper, aiming at authentication key management agreements, tends to provide a security study on the application of authentication key management agreements, covering the establishment, analysis, design, security study, and performance optimization in various environments. Based on present public key schemes, such as public key cryptography, identity‐recognized cryptography, and undocumented cryptography, it aims to establish an authenticated key management agreement suitable for various application environments. Using the one‐way transmission in identity‐recognized cryptography or undocumented cryptography for formulating practical and effective security models, it tends to establish the one‐way authentication key agreement for both parties. Based on the design of single authentication key, an authentication key agreement for the undocumented public key cryptography is proposed to design a security model for the secure and high‐efficiency undocumented two‐party authentication key agreement. Under random oracle model and standard model, the security of the undocumented two‐party authentication key agreement is authenticated. Furthermore, aiming at the computational efficiency, communication efficiency, and key exchange frequency of group key management agreements, this paper aims to propose a method for dynamic membership. Besides, regarding the secure communication environment in different application backgrounds, such as the network applications of Grid, P2P, and ad‐hoc, it would propose practical group key agreements for networks and multi‐node communications to promote the security of group key management and to facilitate the computation of agreements and the optimization of communications. Copyright © 2013 John Wiley & Sons, Ltd.
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.
Abstract. Recently, He et al. (Computers and Mathematics with Applications, 2012, 64(6): 1914-1926) proposed a new efficient certificateless two-party authenticated key agreement protocol. They claimed their protocol was provably secure in the extended Canetti-Krawczyk (eCK) model. In this paper, we will show that their protocol is insecure. A type I adversary, who obtains one party’s ephemeral private key, can impersonate the party to cheat the other party and compute the shared session key successfully. For overcoming this weakness, we also propose a simple countermeasure.