A novel key agreement protocol based on chaotic maps
Information Sciences: an International Journal
A round- and computation-efficient three-party authenticated key exchange protocol
Journal of Systems and Software
A new key agreement protocol based on chaotic maps
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
A chaotic maps-based key agreement protocol that preserves user anonymity
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
New directions in cryptography
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Recently, Tseng et al. proposed a novel key agreement protocol based on chaotic maps. They claimed that their protocol achieved the session key agreement between server and users with user's anonymity and security. Although Niu and Wang proposed a new improvement, the presented scheme involved an additional participant, the trusted party, in such a way that the system cost raised a lot. To inherit the superiority of Tseng et al. but remove the security weaknesses, it is worthwhile to point out the kernel of drawback in the scheme of Tseng et al. and, further, propose a security-enhanced scheme by overcoming the drawback with slight modifications. Copyright © 2012 John Wiley & Sons, Ltd.