Efficiency and security problems of anonymous key agreement protocol based on chaotic maps

In 2011, Niu–Wang proposed an anonymous key agreement protocol based on chaotic maps in [Niu Y, Wang X. An anonymous key agreement protocol based on chaotic maps. Commun Nonlinear Sci Simulat 2011;16(4):1986–92]. Niu–Wang’s protocol not only achieves session key agreement between a server and a user, but also allows the user to anonymously interact with the server. Nevertheless, this paper points out that Niu–Wang’s protocol has the following efficiency and security problems: (1) The protocol has computational efficiency problem when a trusted third party decrypts the user sending message. (2) The protocol is vulnerable to Denial of Service (DoS) attack based on illegal message modification by an attacker.

► We study Niu–Wang’s an anonymous key agreement protocol based on chaotic maps.
► We point out that Niu–Wang’s protocol has both efficiency and security problems.
► Niu–Wang’s protocol has computational efficiency problem.
► Niu–Wang’s protocol is vulnerable to Denial of Service (DoS) attack.
► Niu–Wang’s protocol is unsuitable for practical application.