A Password-Authenticated Key Exchange Scheme Using Chaotic Maps towards Multiple Servers to Server

With rapid changes in the modern communication environment such as wireless mesh networks and cloud storing, it is necessary to put forward a kind more flexible and general architecture to adapt it. But the overwhelming majority of passwordauthenticated key agreement protocols using chaotic maps are based on three architectures (client/server, two clients/server and multi-server) and four security models (heuristic security, random oracle, ideal cipher and standard model). Moreover, most of the key exchange schemes adopting chaotic maps are usually by symmetric cryptography for exchanging some information. This will lead to a high calculated amount. Therefore, the paper will wipe out the symmetric cryptography, and only use chaotic maps, a secure pseudo-random function to construct a provable secure password authenticated key agreement protocol towards multiple servers to server architecture in the standard model. The new protocol resists dictionary attacks mounted by either passive or active network intruders, allowing, in principle, even weak password phrases to be used safely. It also offers perfect forward secrecy, privacy protection and some others security attributes. Finally, we give the security proof in the standard model and the efficiency analysis of our proposed scheme.