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

Security and Communication Networks

Cryptanalysis of a robust key agreement based on public key authentication

Mohsen Toorani

Published Oct 30, 2015• 5 citations
Publisher

Abstract

Abstract This paper considers security analysis of the YAK, a public key‐based authenticated key agreement protocol. The YAK protocol is a variant of the two‐pass HMQV protocol but uses zero‐knowledge proofs for proving knowledge of ephemeral values. In this paper, we show that the YAK protocol lacks joint key control and perfect forward secrecy attributes and is vulnerable to some attacks including unknown key‐share and key‐replication attacks. This invalidates the semantic security of the protocol in several security models. There are also other considerations regarding the impersonation and small subgroup attacks. Copyright © 2015 John Wiley & Sons, Ltd.

DOI
10.1002/sec.1373

Related papers

Cryptanalysis and improvement of the YAK protocol with formal security proof and security verification via Scyther

Zeyad Mohammad

Summary Hao proposed the YAK as a robust key agreement based on public‐key authentication, and the author claimed that the YAK protocol withstands all known attacks and therefore is secure against an extremely strong adversary. However, Toorani showed the security flaws in the YAK protocol. This paper shows that the YAK protocol cannot withstand the known key security attack, and its consequences lead us to introduce a new key compromise impersonation attack, where an adversary is allowed to reveal both the shared static secret key between two‐party participation and the ephemeral private key of the initiator party in order to mount this attack. In addition, we present a new security model that covers these attacks against an extremely strong adversary. Moreover, we propose an improved YAK protocol to remedy these attacks and the previous attacks mentioned by Toorani on the YAK protocol, and the proposed protocol uses a verification mechanism in its block design that provides entity authentication and key confirmation. Meanwhile, we show that the proposed protocol is secure in the proposed formal security model under the gap Diffie‐Hellman assumption and the random oracle assumption. Moreover, we verify the security of the proposed protocol and YAK protocol by using an automatic verification method such as the Scyther tool, and the verification result shows that the security claims of the proposed protocol are proven, in contrast to those of the YAK protocol, which are not proven. The security and performance comparisons show that the improved YAK protocol outperforms previous related protocols.

International Journal of Communication Systems•Mar 11, 2020•12 citations

On robust key agreement based on public key authentication

F Hao

This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticatedkey agreement protocols and uncover various theoretical and practical flaws. In particular, we present two new attacks onthe HMQV protocol, which is currently being standardized by IEEE P1363. These attacks suggest the caution one shouldtake when interpreting theoretical results from a formal model. We further point out that many of the protocol failures inthe past are caused by sidestepping an important engineering principle, namely “Do not assume that a message you receivehas a particular form (such as g^r for known r) unless you can check this”. Constructions in the past generally resistedthis principle on the grounds of efficiency: checking the knowledge of the exponent is commonly seen as too expensive.In a concrete example, we demonstrate how to effectively integrate the zero-knowledge proof primitive into the protocoldesign and meanwhile achieve good efficiency. Our new key agreement protocol, YAK, has comparable computationalefficiency to the MQV and HMQV protocols with clear advantages on security. Among all the related techniques, ourprotocol appears to be the simplest so far. We believe simplicity is also an important engineering principle.

•Jan 1, 2014•0 citations

On robust key agreement based on public key authentication

Feng Hao

Abstract. We describe two new attacks on the HMQV protocol. The first attack raises a serious question on the basic definition of “authentica-tion ” in HMQV, while the second attack is generally applicable to many other protocols. In addition, we present a new authenticated key agree-ment protocol called YAK. Our approach is to depend on well-established techniques such as Schnorr’s signature. Among all the related protocols, YAK appears to be the simplest so far. We believe simplicity is an im-portant engineering principle. 1

Security and Communication Networks•Apr 18, 2012•8 citations

Secure and Efficient Two-Party Authenticated Key Agreement Protocol from Certificateless Public Key Encryption Scheme

Mengbo Hou, Qiuliang Xu

As the fundamental building block for secure communication in the open network, authenticated key agreement protocols are usually constructed in the public key setting. Certificateless public key cryptography combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on the efficient certificateless public key encryption scheme due to Cheng and Comley. Security analysis shows that it achieves perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes for authenticated key agreement protocol, such as known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control. Compared to other comparable schemes, it is more secure and has nice efficiency.

International Joint Conference on INC, IMS and IDC (NCM)•Jan 1, 2009•4 citations

Cryptanalysis and enhancement of two-pass authenticated key agreement with key confirmation protocols

Zeyad Mohammad, Yaw-Chung Chen, Chien-Lung Hsu +1 more

AbstractIn NRSC24, Elkamchouchi et al. proposed a new approach for key controlled agreement to provide key control in the Pour public key distribution system. In NRSC25, they further proposed an efficient and confirmed protocol for authenticated key agreement to provide forward secrecy in their previously proposed protocol. This paper, however, will show that Pour’s protocol and Elkamchouchi et al.’s two protocols cannot withstand key compromise impersonation resilience, and man-in-the-middle attacks, and do not have perfect forward secrecy resilience. To eliminate the pointed out security leaks, we further propose a new two-pass authenticated key agreement with a key confirmation protocol. The proposed protocol has the following properties: (i) it is proved to be secure against above attacks and stronger adversary attacks, and provides the desirable security properties as a three-pass authenticated key agreement protocol. (ii) It can provide entity authentication and assurance for key reception in an ind...

IETE Technical Review•Jan 1, 2010•11 citations

Cryptanalysis on Identity-based Authenticated Key Agreement Protocols from Pairings

Mengbo Hou, Qiuliang Xu, Shanqing Guo +1 more

Abstract—Two-party authenticated key agreement protocol is used to authenticate entities and establish session keys in an open network in order to provide secure communications between two parties. Several security attributes are highly desired for such protocols, such as perfect forward secrecy (the corruption of long-term keys of all the entities should not compromise any session key), PKG forward secrecy (the corruption of the PKG's master key in the ID-based system should not compromise the established session keys), and known session-key specific temporary information secrecy (The exposure of private temporary information should not compromise the secrecy of generated session keys). In 2005, Choie et al. proposed three identity-based authenticated key agreement protocols from pairings. Our analysis shows that they all didn't provide protection against known session-key specific temporary information attack and some of them are vulnerable against man-in-the-middle attack, such as the key replicating attack. We analyze some of the attacks under the BR93 security model. Index Terms—key agreement protocol, known session-key specific temporary information secrecy, key replicating attack, security model I.

Journal of Networks•Jun 16, 2010•8 citations
Abstract This paper considers security analysis of the YAK, a public key‐based authenticated key agreement protocol. The YAK protocol is a variant of the two‐pass HMQV protocol but uses zero‐knowledge proofs for proving knowledge of ephemeral values. In this paper, we show that the YAK protocol lacks joint key control and perfect forward secrecy attributes and is vulnerable to some attacks including unknown key‐share and key‐replication attacks. This invalidates the semantic security of the protocol in several security models. There are also other considerations regarding the impersonation and small subgroup attacks. Copyright © 2015 John Wiley & Sons, Ltd.
Summary Hao proposed the YAK as a robust key agreement based on public‐key authentication, and the author claimed that the YAK protocol withstands all known attacks and therefore is secure against an extremely strong adversary. However, Toorani showed the security flaws in the YAK protocol. This paper shows that the YAK protocol cannot withstand the known key security attack, and its consequences lead us to introduce a new key compromise impersonation attack, where an adversary is allowed to reveal both the shared static secret key between two‐party participation and the ephemeral private key of the initiator party in order to mount this attack. In addition, we present a new security model that covers these attacks against an extremely strong adversary. Moreover, we propose an improved YAK protocol to remedy these attacks and the previous attacks mentioned by Toorani on the YAK protocol, and the proposed protocol uses a verification mechanism in its block design that provides entity authentication and key confirmation. Meanwhile, we show that the proposed protocol is secure in the proposed formal security model under the gap Diffie‐Hellman assumption and the random oracle assumption. Moreover, we verify the security of the proposed protocol and YAK protocol by using an automatic verification method such as the Scyther tool, and the verification result shows that the security claims of the proposed protocol are proven, in contrast to those of the YAK protocol, which are not proven. The security and performance comparisons show that the improved YAK protocol outperforms previous related protocols.
This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticatedkey agreement protocols and uncover various theoretical and practical flaws. In particular, we present two new attacks onthe HMQV protocol, which is currently being standardized by IEEE P1363. These attacks suggest the caution one shouldtake when interpreting theoretical results from a formal model. We further point out that many of the protocol failures inthe past are caused by sidestepping an important engineering principle, namely “Do not assume that a message you receivehas a particular form (such as g^r for known r) unless you can check this”. Constructions in the past generally resistedthis principle on the grounds of efficiency: checking the knowledge of the exponent is commonly seen as too expensive.In a concrete example, we demonstrate how to effectively integrate the zero-knowledge proof primitive into the protocoldesign and meanwhile achieve good efficiency. Our new key agreement protocol, YAK, has comparable computationalefficiency to the MQV and HMQV protocols with clear advantages on security. Among all the related techniques, ourprotocol appears to be the simplest so far. We believe simplicity is also an important engineering principle.
Abstract. We describe two new attacks on the HMQV protocol. The first attack raises a serious question on the basic definition of “authentica-tion ” in HMQV, while the second attack is generally applicable to many other protocols. In addition, we present a new authenticated key agree-ment protocol called YAK. Our approach is to depend on well-established techniques such as Schnorr’s signature. Among all the related protocols, YAK appears to be the simplest so far. We believe simplicity is an im-portant engineering principle. 1
As the fundamental building block for secure communication in the open network, authenticated key agreement protocols are usually constructed in the public key setting. Certificateless public key cryptography combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on the efficient certificateless public key encryption scheme due to Cheng and Comley. Security analysis shows that it achieves perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes for authenticated key agreement protocol, such as known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control. Compared to other comparable schemes, it is more secure and has nice efficiency.
AbstractIn NRSC24, Elkamchouchi et al. proposed a new approach for key controlled agreement to provide key control in the Pour public key distribution system. In NRSC25, they further proposed an efficient and confirmed protocol for authenticated key agreement to provide forward secrecy in their previously proposed protocol. This paper, however, will show that Pour’s protocol and Elkamchouchi et al.’s two protocols cannot withstand key compromise impersonation resilience, and man-in-the-middle attacks, and do not have perfect forward secrecy resilience. To eliminate the pointed out security leaks, we further propose a new two-pass authenticated key agreement with a key confirmation protocol. The proposed protocol has the following properties: (i) it is proved to be secure against above attacks and stronger adversary attacks, and provides the desirable security properties as a three-pass authenticated key agreement protocol. (ii) It can provide entity authentication and assurance for key reception in an ind...
Abstract—Two-party authenticated key agreement protocol is used to authenticate entities and establish session keys in an open network in order to provide secure communications between two parties. Several security attributes are highly desired for such protocols, such as perfect forward secrecy (the corruption of long-term keys of all the entities should not compromise any session key), PKG forward secrecy (the corruption of the PKG's master key in the ID-based system should not compromise the established session keys), and known session-key specific temporary information secrecy (The exposure of private temporary information should not compromise the secrecy of generated session keys). In 2005, Choie et al. proposed three identity-based authenticated key agreement protocols from pairings. Our analysis shows that they all didn't provide protection against known session-key specific temporary information attack and some of them are vulnerable against man-in-the-middle attack, such as the key replicating attack. We analyze some of the attacks under the BR93 security model. Index Terms—key agreement protocol, known session-key specific temporary information secrecy, key replicating attack, security model I.