Security Analysis of Password-Authenticated Key Agreement Protocols

2005 ◽  
pp. 49-58 ◽  
Author(s):  
Kyung-Ah Shim ◽  
Seung-Hyun Seo
Keyword(s):  
Key Agreement ◽  
Security Analysis ◽  
Authenticated Key Agreement ◽  
Agreement Protocols

scholarly journals Privacy-Preserving Two-Factor Key Agreement Protocol Based on Chebyshev Polynomials

2021 ◽  
Vol 2021 ◽  
pp. 1-21
Author(s):  
Zuowen Tan
Keyword(s):  
Chebyshev Polynomials ◽  
Key Agreement ◽  
Chaotic Maps ◽  
Security Analysis ◽  
Random Oracle Model ◽  
Security Requirements ◽  
Security Level ◽  
Authenticated Key Agreement ◽  
Practical Applications ◽  
Agreement Protocols

Two-factor authentication is one of the widely used approaches to allow a user to keep a weak password and establish a key shared with a server. Recently, a large number of chaotic maps-based authentication mechanisms have been proposed. However, since the Diffie–Hellman problem of the Chebyshev polynomials defined on the interval [−1,+1] can be solved by Bergamo et al.’s method, most of the secure chaotic maps-based key agreement protocols utilize the enhanced Chebyshev polynomials defined on the interval (−∞,+∞). Thus far, few authenticated key agreement protocols based on chaotic maps have been able to achieve user unlinkability. In this paper, we take the first step in addressing this problem. More specifically, we propose the notions of privacy in authenticated key agreement protocols: anonymity-alone, weak unlinkability, medium unlinkability, and strong unlinkability. Then, we construct two two-factor authentication schemes with medium unlinkability based on Chebyshev polynomials defined on the interval [−1,1] and (−∞,+∞), respectively. We do the formal security analysis of the proposed schemes under the random oracle model. In addition, the proposed protocols satisfy all known security requirements in practical applications. By using Burrows-Abadi-Needham logic (BAN-logic) nonce verification, we demonstrate that the proposed schemes achieve secure authentication. In addition, the detailed comparative security and performance analysis shows that the proposed schemes enable the same functionality but improve the security level.

Strongly secure identity-based authenticated key agreement protocols

2011 ◽  
Vol 37 (2) ◽  
pp. 205-217 ◽  
Author(s):  
Liang Ni ◽  
Gongliang Chen ◽  
Jianhua Li ◽  
Yanyan Hao
Keyword(s):  
Key Agreement ◽  
Authenticated Key Agreement ◽  
Identity Based ◽  
Agreement Protocols

scholarly journals Efficient identity-based authenticated key agreement protocol with provable security for vehicular ad hoc networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771877254 ◽  
Author(s):  
Lanjun Dang ◽  
Jie Xu ◽  
Xuefei Cao ◽  
Hui Li ◽  
Jie Chen ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Key Agreement ◽  
Provable Security ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Authenticated Key Agreement ◽  
Key Agreement Protocol ◽  
Identity Based ◽  
Hoc Networks ◽  
Agreement Protocols

In vehicular ad hoc networks, establishing a secure channel between any two vehicles is fundamental. Authenticated key agreement is a useful mechanism, which can be used to negotiate a shared key for secure data transmission between authentic vehicles in vehicular ad hoc networks. Among the existing identity-based two-party authenticated key agreement protocols without pairings, there are only a few protocols that provide provable security in strong security models such as the extended Canetti–Krawczyk model. This article presents an efficient pairing-free identity-based one-round two-party authenticated key agreement protocol with provable security, which is more suitable for real-time application environments with highly dynamic topology such as vehicular ad hoc networks than the existing identity-based two-party authenticated key agreement protocols. The proposed protocol is proven secure under the passive and active adversaries in the extended Canetti–Krawczyk model based on the Gap Diffie–Hellman assumption. The proposed protocol can capture all essential security attributes including known-session key security, perfect forward secrecy, basic impersonation resistance, key compromise impersonation resistance, unknown key share resistance, no key control, and ephemeral secrets reveal resistance. Compared with the existing identity-based two-party authenticated key agreement protocols, the proposed protocol is superior in terms of computational cost and running time while providing higher security.

Sign in / Sign up

Export Citation Format

Share Document