Open Access Open Access  Restricted Access Subscription Access

An Efficient Chaotic Map-Based Authentication Scheme with Mutual Anonymity


Affiliations
1 College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
2 College of Mathematical Sciences, Dezhou University, Dezhou 253023, China
3 School of Electronic Engineering, Dublin City University, Dublin 9, Ireland
 

A chaotic map-based mutual authentication scheme with strong anonymity is proposed in this paper, in which the real identity of the user is encrypted with a shared key between the user and the trusted server. Only the trusted server can determine the real identity of a user during the authentication, and any other entities including other users of the system get nothing about the user's real identity. In addition, the shared key of encryption can be easily computed by the user and trusted server using the Chebyshev map without additional burdensome key management. Once the partnered two users are authenticated by the trusted server, they can easily proceed with the agreement of the session key. Formal security analysis demonstrates that the proposed scheme is secure under the random oracle model.
User
Notifications
Font Size

Abstract Views: 97

PDF Views: 6




  • An Efficient Chaotic Map-Based Authentication Scheme with Mutual Anonymity

Abstract Views: 97  |  PDF Views: 6

Authors

Yousheng Zhou
College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
Junfeng Zhou
College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
Feng Wang
College of Mathematical Sciences, Dezhou University, Dezhou 253023, China
Feng Guo
School of Electronic Engineering, Dublin City University, Dublin 9, Ireland

Abstract


A chaotic map-based mutual authentication scheme with strong anonymity is proposed in this paper, in which the real identity of the user is encrypted with a shared key between the user and the trusted server. Only the trusted server can determine the real identity of a user during the authentication, and any other entities including other users of the system get nothing about the user's real identity. In addition, the shared key of encryption can be easily computed by the user and trusted server using the Chebyshev map without additional burdensome key management. Once the partnered two users are authenticated by the trusted server, they can easily proceed with the agreement of the session key. Formal security analysis demonstrates that the proposed scheme is secure under the random oracle model.