Development of Tree Structures and Algorithms for the Efficient Group key Management in Multicast Environment


The KIPS Transactions:PartB , Vol. 9, No. 5, pp. 587-598, Oct. 2002
10.3745/KIPSTB.2002.9.5.587,   PDF Download:

Abstract

In multicast environment, the main objective of group key management is to provide security services to group communications by sharing a single group key among all the members of the group and subsequently encrypting and decrypting all the communication messages exchanged among the members of the group. Up to now, there has been no effort to develop group key management mechanism that considers the rate of users' join/leave operations. Hence, in this research, we propose group key management mechanisms that consider the rate of user's join/leave operations. We also define a new tree structure called variable tree which is much more flexible than full regular trees and show that variable trees are more efficient than full regular trees for group key management. Especially, we propose an algorithm that minimizes the necessary number of rekey messages according to the rate of join and leave operations. We also shows that if the rate of leave operation is greater than 50%, then the tree structure with degrees 2 or 3 are the optimal structures.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. H. Han, "Development of Tree Structures and Algorithms for the Efficient Group key Management in Multicast Environment," The KIPS Transactions:PartB , vol. 9, no. 5, pp. 587-598, 2002. DOI: 10.3745/KIPSTB.2002.9.5.587.

[ACM Style]
Keun Hee Han. 2002. Development of Tree Structures and Algorithms for the Efficient Group key Management in Multicast Environment. The KIPS Transactions:PartB , 9, 5, (2002), 587-598. DOI: 10.3745/KIPSTB.2002.9.5.587.