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

Robust and efficient remote authentication with key agreement protocol

H.B. Tang, Liu Xin-song

Published Apr 24, 2013• 0 citations
Publisher
DOI
10.3724/sp.j.1087.2012.01381

Related papers

Password-based remote user authentication and key agreement protocol

Lihua Zhang, Liping Zhang, Youguang Zhang +1 more

Journal of Computer Applications•May 6, 2009•0 citations

Multi-serverAnonymousRemoteAuthenticatedKeyAgreementProtocolBasedonSmartCard

李艳平, 刘小雪, 屈娟 +1 more

Abstract:In order to efficiently eliminate the security shortcomings of the dynamic ID based remote user authentication scheme using smart cards (short for XJWM scheme) proposed by Xu et al.,a new multi server and multi factor anonymous remote authenticated key agreement protocol was presented,based on Diffie Hellman key agreement algorithm and biometrical authentication technology.The new protocol can not only overcome the security flaws of XJWM scheme,but also add smart card’s password and bio information authentication for the cardholder to avoid the smart card stolen attack.The security of the new protocol was proved by the improved BAN logic and the result showed that the new scheme can ensure the correctness of key agreement,key confidentiality,key freshness and mutual authentication.The security and performance analysis demonstrated that the proposed protocol provides better security without increasing too much computation overhead.

•Jan 1, 2016•0 citations

Robust Remote Mutual Authentication Scheme with Key Agreement

Chih-Ho Chou, Kuo‐Yu Tsai, Tzong‐Chen Wu

In 2006, Shieh and Wang proposed a remote mutual authentication and key agreement scheme, in which a user can login to a remote server with his password and smartcard. In Shieh and Wang’s scheme, it requires only hash functions operations during the login and key agreement phase. However, Holbl et al. demonstrated some attacks on Shieh and Wang’s scheme and proposed an improved scheme to overcome the shown attacks in 2010. In this paper, we point out that Holbl et al.’s proposed scheme is still vulnerable to an offline password guessing and forgery attack. In addition, Holbl et al.’s scheme fails to achieve explicit key authentication. We propose a robust remote mutual authentication scheme with key agreement to resist against above mentioned attacks and provide more security requirements.

網際網路技術學刊•Dec 1, 2015•2 citations

Efficient Identity-Based and Authenticated Key Agreement Protocol

Yongge Wang

Lecture notes in computer science•Jan 1, 2013•90 citations

CS-LAKA: A Lightweight Authenticated Key Agreement Protocol With Critical Security Properties for IoT Environments

Yimin Guo, Guo Ya-jun

Anonymity, robust synchronization, and perfect forward secrecy are the most important security properties of authenticated key agreement (AKA) protocols. Designing AKA protocols that simultaneously achieve these security properties and availability in the IoT environment is a challenging task. AKA protocols built using public key cryptographic primitives have advantages in achieving these critical security properties, but performing expensive public-key cryptographic operations is inefficient for resource-constrained IoT devices. The authentication protocols based on symmetric cryptographic primitives are often subject to various attacks. This paper proposes a secure lightweight AKA protocol with critical security properties (called CS-LAKA) for IoT environments without using public-key cryptographic primitives. LAKA cleverly achieves the security goals of anonymity, robust synchronization, and perfect forward secrecy by embedding dynamic identities in authenticators, and a few additional exchange messages are added. This enables LAKA to have both robust security and high efficiency. Subsequently, we perform a formal security analysis to prove that LAKA is secure, and compared with existing related schemes, LAKA has obvious advantages in terms of security, functionality and running performance.

IEEE Transactions on Services Computing•Aug 29, 2023•37 citations

A Robust Authenticated Key Agreement Protocol.

Hyoung-Mok Lee, Eun‐Kyung Ryu, Kee-Won Kim +2 more

Computers and Their Applications•Jan 1, 2003•0 citations
Abstract:In order to efficiently eliminate the security shortcomings of the dynamic ID based remote user authentication scheme using smart cards (short for XJWM scheme) proposed by Xu et al.,a new multi server and multi factor anonymous remote authenticated key agreement protocol was presented,based on Diffie Hellman key agreement algorithm and biometrical authentication technology.The new protocol can not only overcome the security flaws of XJWM scheme,but also add smart card’s password and bio information authentication for the cardholder to avoid the smart card stolen attack.The security of the new protocol was proved by the improved BAN logic and the result showed that the new scheme can ensure the correctness of key agreement,key confidentiality,key freshness and mutual authentication.The security and performance analysis demonstrated that the proposed protocol provides better security without increasing too much computation overhead.
In 2006, Shieh and Wang proposed a remote mutual authentication and key agreement scheme, in which a user can login to a remote server with his password and smartcard. In Shieh and Wang’s scheme, it requires only hash functions operations during the login and key agreement phase. However, Holbl et al. demonstrated some attacks on Shieh and Wang’s scheme and proposed an improved scheme to overcome the shown attacks in 2010. In this paper, we point out that Holbl et al.’s proposed scheme is still vulnerable to an offline password guessing and forgery attack. In addition, Holbl et al.’s scheme fails to achieve explicit key authentication. We propose a robust remote mutual authentication scheme with key agreement to resist against above mentioned attacks and provide more security requirements.
Anonymity, robust synchronization, and perfect forward secrecy are the most important security properties of authenticated key agreement (AKA) protocols. Designing AKA protocols that simultaneously achieve these security properties and availability in the IoT environment is a challenging task. AKA protocols built using public key cryptographic primitives have advantages in achieving these critical security properties, but performing expensive public-key cryptographic operations is inefficient for resource-constrained IoT devices. The authentication protocols based on symmetric cryptographic primitives are often subject to various attacks. This paper proposes a secure lightweight AKA protocol with critical security properties (called CS-LAKA) for IoT environments without using public-key cryptographic primitives. LAKA cleverly achieves the security goals of anonymity, robust synchronization, and perfect forward secrecy by embedding dynamic identities in authenticators, and a few additional exchange messages are added. This enables LAKA to have both robust security and high efficiency. Subsequently, we perform a formal security analysis to prove that LAKA is secure, and compared with existing related schemes, LAKA has obvious advantages in terms of security, functionality and running performance.