By Topic

New Efficient and Authenticated Key Agreement Protocol in Dynamic Peer Group

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

3 Author(s)
Shengke Zeng ; Sch. of Math. & Comput. Eng., Xihua Univ., Chengdu ; Mingxing He ; Weidong Luo

The members in the dynamic peer group (DPG) are divided into several clusters according to linker cluster architecture (J.B. Dennis and E. Anthony, 1981). In each cluster, the members perform the BD protocol (M. Burmester and Y. Desmedt, 1994) to establish the cluster key and the TGDH protocol (Y. Kim et al., 2004) is performed among the clusters to generate the group key. This method can not only avoid the weakness of AKA (auxiliary key agreement) of BD, but also reduce the computation cost of TGDH scheme. In our scheme the members have been authenticated based identity, and we prove the security in random oracle model.

Published in:

Availability, Reliability and Security, 2008. ARES 08. Third International Conference on

Date of Conference:

4-7 March 2008