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 Computer Applications

Improved two-party authenticated key agreement protocol

Zhang Long-xiang

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

Two-party authenticated key agreement is one of the methods to generate session keys.In this paper,the authors analyzed a new provably secure two-party authenticated key agreement protocol proposed in 2011 by Jianjie Zhao et al.and pointed out that this protocol was not secure if the adversary can obtain the long-term key of a participant.Then an improved protocol was presented,and in the new scheme,the parameters that may leak the long-term keys were encrypted.The authors also discussed the security and computational cost of the new scheme.The result shows that the new protocol realizes the secure key agreement with lower computational cost.

Related papers

A Two-Party Key Agreement Protocol Based on Signature Scheme

Wang Tian-cheng

Two-Party authenticated key agreement is one of methods to generate session key.In this paper,we propose a new Two-Party agreement protocol based on the traditional signature scheme.The new scheme realizes the hiding of the information between the participants.We use Hash function to enhance the security of our protocol.

Microelectronics & Computer•Jan 1, 2013•0 citations

Provably Secure Two-Party Authenticated Key Exchange Protocol in eCK Model

Zhao Jian

How to construct secure key agreement protocol is one of the most challenging problems in information security area.However,most of the current secure protocols can only achieve heuristic security,the security assumptions and efficiencies of these protocols are not perfect.To solve these problems,the authors propose a new 2 rounds two-party authenticated key agreement protocol and point out some principles to construct a secure protocol by analyzing the security properties of the protocol,then prove strictly that the new protocol is secure in eCK model.According to pertinent literature,eCK model provides the strongest definition of security for two party key agreement protocol at present.Performance analysis shows that the protocol has a good balance between computational cost and security assumption.The authors also present a three-round variant of the protocol to realize key conformation property.

Chinese Journal of Computers•Jan 1, 2011•0 citations

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

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 Journal•Jan 1, 2010•0 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

Pairing-Based Two-Party Authenticated Key Agreement Protocol.

Rongxing Lu, Zhenfu Cao, Renwang Su +1 more

Abstract. To achieve secure data communications, two parties should be authenticated by each other and agree on a secret session key by exchanging messages over an insecure channel. In this paper, based on the bilinear pairing, we present a new two-party authenticated key agreement protocol, and use the techniques from provable security to examine the security of our protocol within Bellare-Rogaway model. 1

•Jan 1, 2005•6 citations
Two-party authenticated key agreement is one of the methods to generate session keys.In this paper,the authors analyzed a new provably secure two-party authenticated key agreement protocol proposed in 2011 by Jianjie Zhao et al.and pointed out that this protocol was not secure if the adversary can obtain the long-term key of a participant.Then an improved protocol was presented,and in the new scheme,the parameters that may leak the long-term keys were encrypted.The authors also discussed the security and computational cost of the new scheme.The result shows that the new protocol realizes the secure key agreement with lower computational cost.
How to construct secure key agreement protocol is one of the most challenging problems in information security area.However,most of the current secure protocols can only achieve heuristic security,the security assumptions and efficiencies of these protocols are not perfect.To solve these problems,the authors propose a new 2 rounds two-party authenticated key agreement protocol and point out some principles to construct a secure protocol by analyzing the security properties of the protocol,then prove strictly that the new protocol is secure in eCK model.According to pertinent literature,eCK model provides the strongest definition of security for two party key agreement protocol at present.Performance analysis shows that the protocol has a good balance between computational cost and security assumption.The authors also present a three-round variant of the protocol to realize key conformation property.
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.
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.
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.