A secure and effective anonymous authentication scheme for roaming service in global mobility networks

Dawei Zhao, Haipeng Peng, Lixiang Li, Yixian Yang

Abstract

Recently, Mun et al. analyzed Wu et al.'s authentication scheme and proposed an enhanced anonymous authentication scheme for roaming service in global mobility networks. However, through careful analysis, we find that Mun et al.'s scheme is vulnerable to impersonation attacks, off-line password guessing attacks, and insider attacks, and cannot provide user friendliness, user's anonymity, proper mutual authentication, and local verification. To remedy these weaknesses, in this paper we propose a novel anonymous authentication scheme for roaming service in global mobility networks. Security and performance analyses show the proposed scheme is more suitable for the low-power and resource-limited mobile devices, and is secure against various attacks and has many excellent features.

Introduction

In a Global Mobility Network (GLOMONET), a mobile user (MU) traveling outside their home territory must connect via a "Foreign Agent" (FA) while still authenticating with their "Home Agent" (HA). This three-way handshake is a critical juncture for security and privacy. Previous attempts at solving this, notably schemes by Wu et al. and Mun et al., suffered from several "deal-breaker" vulnerabilities:

  • Lack of Anonymity: Attackers could track a user’s movements by monitoring static values in the login messages.
  • Vulnerability to Attacks: They were susceptible to "off-line password guessing" (where an attacker captures a message and tries millions of passwords locally) and "insider attacks" (where a malicious employee at the Home Agent could steal user credentials).
  • Poor User Experience: Some required users to remember complex cryptographic strings rather than simple passwords.

The Proposed Scheme

The authors propose a novel protocol based on Elliptic Curve Cryptography (ECC). ECC is favored in mobile environments because it provides high-level security with much smaller key sizes and faster computation than traditional methods like RSA.

Key technical components include:

  • Smart Card Integration: The user’s identity and password are verified locally by a smart card before any data is sent over the network, preventing unnecessary traffic from typos or simple forgery.
  • Dynamic Identity ($DID_{MU}$): Instead of sending a static username, the protocol generates a unique "alias" for every session using ECC scalar multiplication and XOR operations.
  • Mutual Authentication: The protocol ensures that the User, the Foreign Agent, and the Home Agent all verify each other’s identities through a series of cryptographic challenges and digital signatures.
  • Two-Factor Security: Security relies on both "something you have" (the smart card) and "something you know" (the password).
Registration phase interaction between the Mobile User (MU) and Home Agent (HA).

Key Insights and Ideas

  • Solving the "Insider" Threat: In many older schemes, the Home Agent (HA) stored enough information to impersonate the user. In this new scheme, the HA only receives a hashed version of the password combined with a random number ($x_{MU}$), meaning even a rogue admin at the HA cannot recover the user's actual password.
  • Perfect Forward Secrecy: The session keys are generated using one-time random numbers ($a$ and $b$). Even if an attacker steals all the passwords in the system later, they cannot go back and decrypt past conversations because the session keys were never stored and cannot be reconstructed.
  • Efficiency via Local Verification: By having the smart card check the password locally ($H^* = H$), the system avoids the "Lack of Local Verification" flaw found in Mun et al.’s scheme, which forced the network to process login requests even if the user had simply mistyped their password.

Performance and Security Analysis

The authors compared their scheme against several contemporary protocols (Wu et al., Chang et al., He et al., Mun et al., and Li-Lee) across three metrics:

  1. Security Features: The proposed scheme was the only one to satisfy all 11 identified requirements, including anonymity, resistance to insider attacks, and "friendly" password changes.
  2. Communication Cost: The scheme requires 4 rounds of communication and approximately 3808 bits of data transfer. While slightly heavier than some non-anonymous schemes, it is significantly leaner than the Li-Lee ECC scheme (8224 bits).
  3. Computational Efficiency: On the mobile side, the scheme requires only one point scalar multiplication (the most "expensive" ECC operation) during the login phase, making it highly suitable for low-power devices.

Conclusion and Future Work

While the proposed scheme offers robust security, it maintains a dependency on the physical security of the smart card. If the physical side-channel protections of the card are defeated, the security margin narrows. Furthermore, like most ECC-based protocols from this era, the scheme is vulnerable to future quantum computing attacks (Shor’s algorithm). Future work may involve adapting the underlying logic of "local verification + ECC-based anonymity" for other roaming scenarios like 4G/5G handovers or IoT mesh networks, potentially exploring post-quantum alternatives.

Summary updated

Abstract

Recently, Mun et al. analyzed Wu et al.'s authentication scheme and proposed a enhanced anonymous authentication scheme for roaming service in global mobility networks. However, through careful analysis, we find that Mun et al.'s scheme is vulnerable to impersonation attacks, off-line password guessing attacks and insider attacks, and cannot provide user friendliness, user's anonymity, proper mutual authentication and local verification. To remedy these weaknesses, in this paper we propose a novel anonymous authentication scheme for roaming service in global mobility networks. Security and performance analyses show the proposed scheme is more suitable for the low-power and resource-limited mobile devices, and is secure against various attacks and has many excellent features.
BibTeX
@inproceedings{zhao2014secure,
  author = {Dawei Zhao and Haipeng Peng and Lixiang Li and Yixian Yang},
  title = {{A secure and effective anonymous authentication scheme for roaming service in global mobility networks}},
  booktitle = {Wirel. Pers. Commun},
  year = {2014},
  url = {https://openreview.net/forum?id=WwfOSZVQ3uE},
}
Figure