Work place: Ramanujan Computing Centre Anna University, Chennai, India
E-mail:
Website:
Research Interests:
Biography
By R. Varalakshmi V. Rhymend Uthariaraj
DOI: https://doi.org/10.5815/ijitcs.2012.01.05, Pub. Date: 8 Feb. 2012
In the present paper, we propose a new scheme for a scalable multicast key distribution scheme. The present scheme is based on the Key Management using Tabulation method of Boolean Function Simplification technique. It explores the use of batching of group membership changes to reduce the frequency, and hence the cost, of key re-distribution operations. It focuses explicitly on the issue of snowballing member removal and presents an algorithm that minimizes the number of messages required to distribute new keys to the remaining group members. The algorithm is used in conjunction with a new scalable multicast key distribution scheme which uses a set of auxiliary keys in order to improve scalability. In contrast to previous schemes which generate a fixed hierarchy of keys, the proposed scheme dynamically generates the most suitable key hierarchy by composing different keys. Our snowballing member removal uses one of the Boolean function simplification techniques called tabulation method, and outperforms all other schemes known to us in terms of message complexity. Most importantly, our technique is superior in minimizing the number of messages when multiple members leave the session in the same round.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals