Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Optimal tree structure for key management of simultaneous join/leave in secure multicast

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)
Zhu, F. ; Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA ; Chan, A. ; Noubir, G.

As applications of secure multicast in networks continue to grow, the demand for an efficient scheme to manage group keys for secure group communication becomes more urgent. In this paper, we propose a new key tree structure for group key management. With this optimal tree structure, system resources such as network bandwidth can be saved. We devise an algorithm to generate this optimal tree and show that it can be implemented efficiently. We also design an adaptive system for group key management which consists of four components: a request receiver, a key tree update controller, a delay calculator and a request predictor. This system can maintain the optimality of the key tree dynamically. It is verified by theoretical analysis and simulation result that the performance of our scheme is better than other schemes based on traditional tree structures.

Published in:

Military Communications Conference, 2003. MILCOM '03. 2003 IEEE  (Volume:2 )

Date of Conference:

13-16 Oct. 2003