A Scalable Key-Distribution Scheme for Dynamic Multicast Groups

∗ This work was done within the project “Optimisation of the Internet Protocols over Satellite”. This project was financed by the European Space Agency. Abstract: In this paper, we address the problem of key distribution for large dynamic groups. We propose algorithms that require only an O(log |M|) (where |M| denotes the size of the group) message communication complexity when a member leaves the group [Noub98]. The other advantage of these algorithms is that they can be implemented in a centralized entity, which makes them very adapted to multicast over satellite.