An Efficient Chaotic Map-Based Authentication Scheme with Mutual Anonymity

  • Zhou Y
  • Zhou J
  • Wang F
  • et al.
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Zhou, Y., Zhou, J., Wang, F., & Guo, F. (2016). An Efficient Chaotic Map-Based Authentication Scheme with Mutual Anonymity. Applied Computational Intelligence and Soft Computing, 2016, 1–10. https://doi.org/10.1155/2016/3916942

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free