A Multi-Server Two-Factor Authentication Scheme with Un-Traceability Using Elliptic Curve Cryptography.

Area of Science:

• Computer Science
• Cryptography
• Network Security

Background:

• Authentication and key-agreement schemes are crucial for secure communication in multi-server environments, IoT, and WSNs.
• Existing schemes by Amin et al. and Srinivas et al. have security flaws, including lack of perfect forward secrecy, user untraceability, and vulnerability to attacks.

Purpose of the Study:

• To analyze the security weaknesses of existing authentication schemes.
• To propose a novel, efficient, and secure multi-server two-factor authentication scheme.
• To ensure user untraceability and perfect forward secrecy.

Main Methods:

• Analysis of existing RSA-based and multi-server authentication schemes.
• Development of a new multi-server two-factor authentication scheme utilizing Elliptic Curve Cryptography (ECC).
• Security validation through heuristic analysis and Burrows-Abadi-Needham (BAN-Logic) proof.

Main Results:

• Identified vulnerabilities in Amin et al.'s and Srinivas et al.'s schemes, including susceptibility to offline password guessing and key-compromise impersonation attacks.
• The proposed ECC-based scheme provides perfect forward secrecy and user untraceability.
• The new scheme is robust against known attacks and computationally efficient.

Conclusions:

• The presented multi-server two-factor authentication scheme effectively addresses the security limitations of prior works.
• The use of ECC enhances security and efficiency for authentication in complex network environments.
• The scheme offers a feasible and robust solution for secure communication in multi-server settings.