Improved chaotic maps-based password-authenticated key agreement using smart cards

Lin, Han-Yu

doi:10.1016/j.cnsns.2014.05.027

Cited by 47 publications

(62 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Regarding the protocols in the works of Gue and Chang and Xiao et al, both of them also apply the timestamp to measure the freshness of received messages, meaning they have potential synchronization problems. Similar to the work of Lin, because the protocols of Gue and Chang and Xiao et al use additionally symmetric encryption/decryption operations, their computation cost is higher than ours. In the same study, Lin pointed out that the session key in 1 study can be derived using the method in another study once the messages transmitted in the authenticated key exchange procedure are intercepted.…”

Section: Performance Evaluationmentioning

confidence: 65%

“…Similar to the work of Lin, because the protocols of Gue and Chang and Xiao et al use additionally symmetric encryption/decryption operations, their computation cost is higher than ours. In the same study, Lin pointed out that the session key in 1 study can be derived using the method in another study once the messages transmitted in the authenticated key exchange procedure are intercepted. Additionally, Guo and Chang's protocol does not preserve privacy.…”

Section: Performance Evaluationmentioning

confidence: 65%

“…Next, we summarize the performance comparisons between other chaotic map–based AKA schemes and ours in Table . All the relevant protocols, including ours, use the semigroup property of the Chebyshev polynomial to compute the shared session key and authentication information.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Finally, we compare security features of our scheme with other chaotic map–based AKA schemes in Table . As shown in Table , Lin's protocol and ours fulfill the most security features.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 3 more Smart Citations

Smart card–based password authenticated key agreement protocol using chaotic maps

Cheng

Chang

Lo³

2017

Int J Communication

View full text Add to dashboard Cite

Summary In 2015, Lee proposed time stamp–based and nonce‐based password authenticated key agreement protocols based on the Chebyshev chaotic map to enhance the security of relevant schemes. However, in this paper, we demonstrate that Lee's protocols are vulnerable to user impersonation and stolen verifier attacks. To overcome these security problems, we thus provide an improved version using a smart card. Security analysis and comparisons show that the proposed protocol is more secure and maintains better performance. Furthermore, we perform a formal verification of the proposed protocol using the widely accepted AVISPA tool for error detection.

show abstract

Section: Performance Evaluationmentioning

confidence: 65%

Section: Performance Evaluationmentioning

confidence: 65%

Section: Performance Evaluationmentioning

confidence: 99%

“…Finally, we compare security features of our scheme with other chaotic map–based AKA schemes in Table . As shown in Table , Lin's protocol and ours fulfill the most security features.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 2 more Smart Citations

Smart card–based password authenticated key agreement protocol using chaotic maps

Cheng

Chang

Lo³

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In 2013, Guo et al [21] proposed a password-authenticated using smart card. In 2015, Lin et al [24] proposed an improved chaotic maps based authentication protocol using smart card.…”

Section: Introductionmentioning

confidence: 99%

A Privacy-Preserving Roaming Authentication Scheme for Ubiquitous Networks

Zhou¹,

Zhou²,

Wang³

2016

ijacsa

View full text Add to dashboard Cite

Abstract-A privacy-preserving roaming authentication scheme (PPRAS) for ubiquitous networks is proposed, in which a remote mobile user can obtain the service offered by a foreign agent after being authenticated. In order to protect the mobile user's privacy, the user presents an anonymous identity to the foreign agent with the assistance of his or her home agent to complete the authentication. After that, the user and the foreign agent can establish a session key using the semi-group property of Chebyshev polynomial. In this way, huge burden of key management is avoided. Furthermore, the user can update the login password and the session key between itself and the foreign agent if necessary. The correctness is proved using BAN logic, and the performance comparison against the existing schemes is given as well.

show abstract

An efficient chaos‐based 2‐party key agreement protocol with provable security

Luo

Zhang

Khan

et al. 2017

Int J Communication

View full text Add to dashboard Cite

Key agreement protocol is an important cryptographic primitive, which allows 2 parties to establish a secure session in an open network environment. A various of key agreement protocols were proposed. Nowadays, there still exists some other security flaws waiting to be solved. Owing to reduce the computational and communication costs and improve the security, chaotic map has been studied in-depth and treated as a good solution. Recently, Liu et al proposed a chaos-based 2-party key agreement protocol and demonstrated that it can defend denial-of-service attack and replay attack. We found, however, it cannot resist off-line password-guessing attack, and it also has some other security flaws. In this paper, we propose an improved chaos-based 2-party key agreement protocol. The results prove that the protocol can solve the threats of off-line password-guessing attack and other security flaws in the security proof section. What is more, performance analysis shows that the computational cost of the improved protocol is lower than Liu et al protocol. KEYWORDS chaotic map, impersonation attack, key agreement, provale security 1 Int J Commun Syst. 2017;30:e3288.wileyonlinelibrary.com/journal/dac efficient chaos-based two-party key agreement protocol with provable security. Int J Commun Syst. 2017;30:e3288.

show abstract

Improved chaotic maps-based password-authenticated key agreement using smart cards

Cited by 47 publications

References 23 publications

Smart card–based password authenticated key agreement protocol using chaotic maps

Smart card–based password authenticated key agreement protocol using chaotic maps

A Privacy-Preserving Roaming Authentication Scheme for Ubiquitous Networks

An efficient chaos‐based 2‐party key agreement protocol with provable security

Contact Info

Product

Resources

About