By Topic

Group key management utilizing Huffman and Petrick based approaches

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
$33 $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

1 Author(s)
S. Ilango ; Nova Univ., Dania, FL, USA

One of the major issues in secure multicast networks is scalable key distribution. When user(s) leave(s) the group, the group key has to be changed and the new key has to be distributed to the remaining users. If the size of the group is large, distribution overhead increases. We propose the Modified Huffman Technique for efficiently distributing the key(s), after the removal of users from a secure group. In the presence of multiple leaves, the overhead gets compounded. We utilize Petrick's method of Boolean logic minimization instead of QuineMcLuskey method for a better performance in the case of multiple leaves. Simulation results confirm that our scheme minimizes the number of keys that has to be changed after user's exit from the network and hence reduces the redistribution overhead.

Published in:

Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on  (Volume:2 )

Date of Conference:

5-7 April 2004