Secure group communication using binomial trees

Numerous emerging applications like teleconferencing, scientific discussion etc. are relied on secure group communication model. Scalable group rekeying is one of the important issues in secure group communication since the group is dynamic in nature. Updating the group key and delivering it to group members securely must be carried out in an efficient manner, i.e., the number of encryptions performed and rekey messages constructed must be less. In this paper we propose a new method to manage secure group using binomial key tree approach. We show that number of encryptions performed and rekey messages constructed during membership change are less compared to the scheme proposed by Wong and others. In our scheme, it is not required to balance the tree after membership change. We compute the average encryption and rekey costs and show that the scheme is scalable.