By Topic

EDKAS: A Efficient Dist: ributed Key Agreement Scheme Usinng One Way Function Trees for Dynamic Collaborative Groups

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

5 Author(s)
Jiang Zhang ; Dept. of Comput. Sci., Tsinghua Univ., Beijing ; Bin Li ; Chun-Xiao Chen ; Pin Tao
more authors

The increasing popularity of distributed and collaborative applications prompts the need for secure communication in collaborative groups. Some distributed collaborative key management protocols have been proposed to provide group communication privacy and data confidentiality for collaborative groups. However, most of them rekey on each member change, and the costs of group rekeying can be quite substantial for large groups with frequent membership changes. In this paper, we propose a efficient distributed key agreement scheme using a distributed one-way function tree named EDKAS which can significantly reduce the computation and communication costs of maintaining the group key especially in a highly dynamical environment based upon period-based group rekeying. Performance of the period-based group rekeying algorithm is analyzed and evaluated under different settings. A comparison with previous work has shown that EDKAS provides high rekeying efficiency while preserving both distributed and collaborative properties

Published in:

Computational Engineering in Systems Applications, IMACS Multiconference on  (Volume:2 )

Date of Conference:

4-6 Oct. 2006