By Topic

Optimizing centralized secure group communications with binary key tree recomposition

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

4 Author(s)
Jen-Chiun Lin ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Chien-Hua Tzeng ; Feipei Lai ; Hung-Chang Lee

The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models, In this paper, we propose an approach to reduce the path length of a binary key tree managed by a centralized group key server by recomposing it, such that subsequent group operations can benefit from fewer auxiliary key updates, fewer encryptions, and less multicast bandwidth. The server can recompose the key tree in a join or a leave operation without the use of additional auxiliary keys or encryptions. An optimal composition algorithm is presented. It is shown in our analysis that the algorithm is effective to reduce the path length of a binary key tree in join operations and leave operations.

Published in:

Advanced Information Networking and Applications, 2004. AINA 2004. 18th International Conference on  (Volume:1 )

Date of Conference: