By Topic

Recommendations in using group key management algorithms

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

2 Author(s)
Weifeng Chen ; Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA ; L. R. Dondeti

We study the advantages and applicability of stateful and stateless rekeying algorithms to different applications. We analytically compare the storage cost and the rekeying cost (number of unit-size encrypted messages) of LKH and SDR in immediate and batch rekeying scenarios. We implemented the two algorithms and simulated different membership scenarios to compare the rekeying cost. The simulation study shows that LKH performs better in immediate rekeying and small batch rekeying, whereas stateless rekeying performs better as we process membership changes in larger batches. In some cases, stateless rekeying was observed to be as inefficient as encrypting the group key separately for each member of the group. We also report on the effect of member adjacency on rekeying cost. Based on our analysis, we make recommendations in using group key management algorithms for various application scenarios.

Published in:

DARPA Information Survivability Conference and Exposition, 2003. Proceedings  (Volume:2 )

Date of Conference:

22-24 April 2003