Provably Secure and Repeatable Authenticated Privacy-Protection Scheme Using Chaotic Maps with Distributed Architecture

Hongfeng Zhu ； Junlin Liu

《International Journal of Network Security》 20卷3期 (2018/05) Pp. 463-471

https://doi.org/10.6633/IJNS.201805.20(3).08

摘要

Nowadays, the distributed password-authenticated key agreement schemes become more and more popular. Compare with the three traditional architectures (client/server, two clients/server and multi-server), the distributed architecture can solve problems of single-point of security, single-point of efficiency and single-point of failure. Moreover, it has the characteristics of scalability, flexibility and fairness. In the paper, we proposed a new Provably Secure and Distributed Privacy-Protection scheme using chaotic maps. The proposed scheme firstly achieves mutual authenticated among three nodes in three rounds with privacy protection, and at the same time, the unregistered server can store a temporary authenticator for a while for improving the efficiency. Security of the scheme is based on chaotic maps hard problems and a secure one way hash function. Compared with the related literatures recently, our proposed scheme can not only own high efficiency and unique functionality, but is also robust to various attacks and achieves perfect for- ward secrecy. Finally, we give the security proof and the efficiency analysis of our proposed scheme.

關鍵字

Chaotic Maps Keywords ； Distributed Architecture ； Key Agreement ； Privacy-protection