Efficient Algorithms for Secure Multicast key Management

Group multicast is becoming a prevalent issue in network applications such as teleconferencing, pay-per-view, and information services. In order to secure group communications by providing confidentiality and trustworthiness of messages, various methods were proposed in the literature. In this paper, we compare some of these methods. In particular, we consider the exclusive basis systems, and the batch re-keying methods. We also simulate the process of subgroup eviction for exclusion basis system (EBS) and we compare the work that needs to be done in a group-join and a group-eviction both in EBS and in batch re-keying process. The comparisons of EBS with algorithms for batch re-keying process show that for group eviction batch process is more efficient while EBS is for group join