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

International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)

Cryptanalysis of Two Tripartite Authenticated Key Agreement Protocols

Yang Lu, Quanling Zhang, Jiguo Li

Published Aug 1, 2015• 3 citations
Publisher

Abstract

The tripartite authenticated key agreement (AKA) protocol is crucial in providing data confidentiality to subsequent communications among three parties over an insecure public network. In recent years, several identity-based and certificate less tripartite AKA protocols have been proposed. Unfortunately, most of them are insecure. In this paper, we analyze an identity-based tripartite AKA protocol and a certificate less tripartite AKA protocol. Our cryptanalysis shows that one neither meets the desirable security properties.

DOI
10.1109/dcabes.2015.47

Related papers

Weakness of Several Identity-based Tripartite Authenticated Key Agreement Protocols.

Xi Lin, Lin Sun

Abstract: Key agreement allows multi-parties exchanging public information to create a common secret key that is known only to those entities over an insecure network. In recent years, several identity-based authenticated key agreement protocols have been proposed. In this study, we analyze three identity-based tripartite authenticated key agreement protocols. After the analysis, we found that these protocols do not possess the desirable security attributes.

•Jan 1, 2013•2 citations

Cryptanalysis of Three Certificate-Based Authenticated Key Agreement Protocols and a Secure Construction.

Yang Lu, Quanling Zhang, Jiguo Li

Certificate-based cryptography is a new public-key cryptographic paradigm that has very appealing features, namely it simplifies the certificate management problem in traditional public key cryptography while eliminating the key escrow problem in identity-based cryptography. So far, three authenticated key agreement (AKA) protocols in the setting of certificate-based cryptography have been proposed in the literature. Unfortunately, none of them are secure under the public key replacement (PKR) attack. In this paper, we first present a security model for certificate-based AKA protocols that covers the PKR attacks. We then explore the existing three certificate-based AKA protocols and show the concrete attacks against them respectively. To overcome the weaknesses in these protocols, we propose a new certificate-based AKA protocol and prove its security strictly in the random oracle model. Performance comparison shows that the proposed protocol outperforms all the previous certificate-based AKA protocols.

•Jan 1, 2015•0 citations

An Improvement of Certification-based One-Round Tripartite Key Agreement Protocols

Kambombo Mtong, Eun‐Jun Yoon

Key agreement protocols allow multi-parties exchanging public information to create a common secret key that is known only to those entities over an insecure network. Since Joux first published the pairing-based one round tripartite key agreement protocol, many authenticated protocols have been proposed. Unfortunately, many of them have been broken while others have been shown to be deficient in some desirable security attributes. In 2004, Cheng et al. presented two protocols aimed at strengthening Shim’s certificate-based and Zhang et al.’s tripartite identitybased protocols. This paper reports that 1) In Cheng et al.’s identity-based protocol, an adversary can extract long-term private keys of all the parties involved; and 2) Cheng et al.’s certificationbased protocol is weak against key integrity attacks. This paper suggests possible remedies for the security flaws in both protocols and then presents a modified Cheng et al.’s identity-based, oneround tripartite protocol that is more secure than the original protocol.

IEIE Transactions on Smart Processing and Computing•Oct 1, 2013•0 citations

A new certificateless authenticated two-party key agreement

YuXiu-Ying, ZhangWen-Fang, HeDa-Ke

Authenticated key agreement (AKA) protocol allows two or multi-parties exchange messages, authenticate each other and establish shared session keys for later secure communications over an open network. The certificateless -based authenticated key agreement protocols combined the advantages of the traditional PKI and the identity-based cryptography. This paper analyzes a proposed AKA protocol[6] and presents a new certificateless AKA protocol. Furthermore, we examines the security of the new protocol and compare it to the existing certificateless key agreement protocols in efficiency. The new proposed scheme achieves almost all of the desired security attributes and is more practicable.

IEEE International Conference on Computer Science and Automation Engineering•Jun 1, 2011•0 citations

Cryptanalysis and Improvement of Several Identity-Based Authenticated and Pairing-Free Key Agreement Protocols for IoT Applications

Haiyan Sun, Chaoyang Li, Jianwei Zhang +2 more

Internet of Things (IoT) applications have been increasingly developed. Authenticated key agreement (AKA) plays an essential role in secure communication in IoT applications. Without the PKI certificate and high time-complexity bilinear pairing operations, identity-based AKA (ID-AKA) protocols without pairings are more suitable for protecting the keys in IoT applications. In recent years, many pairing-free ID-AKA protocols have been proposed. Moreover, these protocols have some security flaws or relatively extensive computation and communication efficiency. Focusing on these problems, the security analyses of some recently proposed protocols have been provided first. We then proposed a family of eCK secure ID-AKA protocols without pairings to solve these security problems, which can be applied in IoT applications to guarantee communication security. Meanwhile, the security proofs of these proposed ID-AKA protocols are provided, which show they can hold provable eCK security. Some more efficient instantiations have been provided, which show the efficient performance of these proposed ID-AKA protocols. Moreover, comparisons with similar schemes have shown that these protocols have the least computation and communication efficiency at the same time.

Sensors•Dec 22, 2023•1 citation

An Efficient Certificate-Based Authenticated Key Agreement Protocol without Bilinear Pairing

Yang Lu, Quanling Zhang, Jiguo Li +1 more

An authenticated key agreement (AKA) protocol is extremely essential to secure communications over insecure public networks. It enables the communication parties to securely set up a shared session key in present of the malicious attackers. Certificate-based cryptography (CBC) is a novel public-key cryptographic primitive that has many attractive merits. It solves the certificate revocation problem in conventional public-key cryptography and the key-escrow problem in identity-based cryptography. Till now, four AKA protocols have been proposed in the setting of CBC. However, all of them adopt the costly bilinear pairings and are not suitable for the devices which have limited computing resources and battery power. So, it is interesting and worthwhile to design a certificate-based AKA protocol without using the bilinear pairings. In this paper, we develop a pairing-free certificate-based AKA protocol. The proposed protocol is proven secure under the classic computational Diffie-Hellman assumption in the random oracle model. Compared with the previous pairing-based certificate-based AKA protocols, the proposed protocol enjoys obvious advantage in the computation efficiency.DOI: http://dx.doi.org/10.5755/j01.itc.46.3.14968

Information Technology And Control•Sep 7, 2017•2 citations
The tripartite authenticated key agreement (AKA) protocol is crucial in providing data confidentiality to subsequent communications among three parties over an insecure public network. In recent years, several identity-based and certificate less tripartite AKA protocols have been proposed. Unfortunately, most of them are insecure. In this paper, we analyze an identity-based tripartite AKA protocol and a certificate less tripartite AKA protocol. Our cryptanalysis shows that one neither meets the desirable security properties.
Certificate-based cryptography is a new public-key cryptographic paradigm that has very appealing features, namely it simplifies the certificate management problem in traditional public key cryptography while eliminating the key escrow problem in identity-based cryptography. So far, three authenticated key agreement (AKA) protocols in the setting of certificate-based cryptography have been proposed in the literature. Unfortunately, none of them are secure under the public key replacement (PKR) attack. In this paper, we first present a security model for certificate-based AKA protocols that covers the PKR attacks. We then explore the existing three certificate-based AKA protocols and show the concrete attacks against them respectively. To overcome the weaknesses in these protocols, we propose a new certificate-based AKA protocol and prove its security strictly in the random oracle model. Performance comparison shows that the proposed protocol outperforms all the previous certificate-based AKA protocols.
Key agreement protocols allow multi-parties exchanging public information to create a common secret key that is known only to those entities over an insecure network. Since Joux first published the pairing-based one round tripartite key agreement protocol, many authenticated protocols have been proposed. Unfortunately, many of them have been broken while others have been shown to be deficient in some desirable security attributes. In 2004, Cheng et al. presented two protocols aimed at strengthening Shim’s certificate-based and Zhang et al.’s tripartite identitybased protocols. This paper reports that 1) In Cheng et al.’s identity-based protocol, an adversary can extract long-term private keys of all the parties involved; and 2) Cheng et al.’s certificationbased protocol is weak against key integrity attacks. This paper suggests possible remedies for the security flaws in both protocols and then presents a modified Cheng et al.’s identity-based, oneround tripartite protocol that is more secure than the original protocol.
Authenticated key agreement (AKA) protocol allows two or multi-parties exchange messages, authenticate each other and establish shared session keys for later secure communications over an open network. The certificateless -based authenticated key agreement protocols combined the advantages of the traditional PKI and the identity-based cryptography. This paper analyzes a proposed AKA protocol[6] and presents a new certificateless AKA protocol. Furthermore, we examines the security of the new protocol and compare it to the existing certificateless key agreement protocols in efficiency. The new proposed scheme achieves almost all of the desired security attributes and is more practicable.
Internet of Things (IoT) applications have been increasingly developed. Authenticated key agreement (AKA) plays an essential role in secure communication in IoT applications. Without the PKI certificate and high time-complexity bilinear pairing operations, identity-based AKA (ID-AKA) protocols without pairings are more suitable for protecting the keys in IoT applications. In recent years, many pairing-free ID-AKA protocols have been proposed. Moreover, these protocols have some security flaws or relatively extensive computation and communication efficiency. Focusing on these problems, the security analyses of some recently proposed protocols have been provided first. We then proposed a family of eCK secure ID-AKA protocols without pairings to solve these security problems, which can be applied in IoT applications to guarantee communication security. Meanwhile, the security proofs of these proposed ID-AKA protocols are provided, which show they can hold provable eCK security. Some more efficient instantiations have been provided, which show the efficient performance of these proposed ID-AKA protocols. Moreover, comparisons with similar schemes have shown that these protocols have the least computation and communication efficiency at the same time.
An authenticated key agreement (AKA) protocol is extremely essential to secure communications over insecure public networks. It enables the communication parties to securely set up a shared session key in present of the malicious attackers. Certificate-based cryptography (CBC) is a novel public-key cryptographic primitive that has many attractive merits. It solves the certificate revocation problem in conventional public-key cryptography and the key-escrow problem in identity-based cryptography. Till now, four AKA protocols have been proposed in the setting of CBC. However, all of them adopt the costly bilinear pairings and are not suitable for the devices which have limited computing resources and battery power. So, it is interesting and worthwhile to design a certificate-based AKA protocol without using the bilinear pairings. In this paper, we develop a pairing-free certificate-based AKA protocol. The proposed protocol is proven secure under the classic computational Diffie-Hellman assumption in the random oracle model. Compared with the previous pairing-based certificate-based AKA protocols, the proposed protocol enjoys obvious advantage in the computation efficiency.DOI: http://dx.doi.org/10.5755/j01.itc.46.3.14968