Improved Secure and Efficient Chebyshev Chaotic Map-Based User Authentication Scheme

A Chebyshev chaotic map is a method for implementing efficient authentication. Recently, Chatterjee <italic>et al.</italic> proposed an authentication scheme for multi-server/multi-client environments using a Chebyshev chaotic map. However, we found four critical vulnerabilities in the proposed authentication method. To begin with, the method is open to user as well as server impersonation attacks. User revocation is also infeasible. Finally, there is a possibility of critical information leakage. We propose a new scheme that overcomes the four weaknesses listed previously using a symmetric Chebyshev chaotic map. We tested our proposed scheme using ProVerif and AVISPA, and compared its performance with that of the conventional authentication method. Results indicate that our scheme is 44.025 times more efficient than the conventional method.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.