Analysis and Design of Robust Key Schemes for Multicast Communications

Recent literature presents several rooted tree based member deletion/revocation schemes [5,6,7,8,1,2] trying to simultaneously minimize the key storage while providing efficient member deletion /revocation. many of these approaches have different solutions and provide different values for the number of keys to be stored and distributed.In this paper we show these problems can be systematically studied using basic concepts from information theory.