Optimizing Centralized Secure Group Communication with Binary Key Tree Recomposition
Journal
The 18th International Conference on Advanced Information Networking and Applications
Pages
202-207
Date Issued
2004-03
Author(s)
Abstract
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.
Type
conference paper