A provably secure multi-server authentication scheme based on Chebyshev chaotic map

The Internet provides us a lot of online services. Under the conventional single-server architectures, remote users must register separately on each visited server to obtain the required services. In contrast, with a multi-server architecture, users can freely access subscribed services from multiple servers by registering at a single registration center ( RC ). Currently, biometrics are widely applied in user authentication schemes to improve their security. Combining with biometric authentication techniques, we present an anonymous authentication scheme by using Chebyshev chaotic map to achieve authentication of both communicating parties in multi-server scenario. The core point of this new scheme is the use of chaotic mapping to achieve mutual authentication instead of time-consuming authentication methods, thus leading to higher efficiency. Based on the widely used Real-Or-Random(ROR) model and the Proverif tool, we perform a formal security analysis of the proposed scheme. In addition, the comparison of security attributes and performance with other related works indicates that the new scheme can withstand various attacks and better suited to multi-server application scenarios.