By Topic

An Efficient Anonymous Key Agreement Protocol Based on Chaotic Maps

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Huei-Ru Tseng ; Inf. & Commun. Res. Labs., Ind. Technol. Res. Inst., Hsinchu, Taiwan ; Jou, E.

A key agreement protocol is a protocol whereby two or more communicating parties can agree on a key or exchange information over an open communication network in such a way that both of them agree on the established session keys for use in subsequent communications. This paper proposes an efficient anonymous key agreement protocol based on chaotic maps. By utilizing a legitimate pseudonym mechanism, a trusted third party can verify the identity of the user in an efficient way. Therefore, the proposed protocol not only greatly reduces computational costs between communication parties, but also allows users to anonymously interact with the server. Moreover, our analysis shows that the proposed protocol can successfully defend Bergamo et al.'s attack, replay attacks, man-in-the-middle attacks, and stolen-verifier attacks.

Published in:

High Performance Computing and Communications (HPCC), 2011 IEEE 13th International Conference on

Date of Conference:

2-4 Sept. 2011