Netinfo Security ›› 2022, Vol. 22 ›› Issue (12): 25-33.doi: 10.3969/j.issn.1671-1122.2022.12.004

Previous Articles     Next Articles

A Provably Secure Traceability Authentication Protocol Based on Chebyshev Chaotic Map

ZHANG Yu1,2, SUN Guangmin1(), ZHAI Peng1,2, LI Yu1   

  1. 1. Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China
    2. School of Mathematics and Computer Application Technology, Jining University, Qufu 272000, China
  • Received:2022-08-10 Online:2022-12-10 Published:2022-12-30
  • Contact: SUN Guangmin E-mail:gmsun@bjut.edu.cn

Abstract:

In order to reduce computational cost and improve security, a novel traceability verification algorithm was designed by means of the irreversibility of the Hash function and the semigroup characteristic of the Chebyshev chaotic map. Based on the traceability verification algorithm, an authentication protocol of registry centrel offline mode was proposed. The proposed scheme combined the traditional password, biological features and public key cryptography to realize the three-factor authentication and mutual traceability authentication. The dual-key dual-encryption mechanism was designed in the authentication scheme. The calculated one-time key was used to encrypt the transmitted information, which can effectively reduce the computation cost and realize the ciphertext transmission, privacy protection and forward security. Through security analysis, BAN logic proof, and ProVerif simulation tool verification, the results show that the protocol is secure. Compared with other similar schemes, the proposed scheme is safer and more efficient. To conclude, the proposed scheme is easy to be realized in the resource-limited mobile Internet environment.

Key words: Chebyshev chaos map, traceability verification, BAN logic, ProVerif, authentication

CLC Number: