Table of Contents Author Guidelines Submit a Manuscript
Applied Computational Intelligence and Soft Computing
Volume 2016, Article ID 3916942, 10 pages
Research Article

An Efficient Chaotic Map-Based Authentication Scheme with Mutual Anonymity

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

Received 19 December 2015; Revised 7 March 2016; Accepted 17 March 2016

Academic Editor: Christian W. Dawson

Copyright © 2016 Yousheng Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.