Cover page and Table of Contents: PDF (size: 216KB)
Full Text (PDF, 216KB), PP.32-39
Views: 0 Downloads: 0
Multicast key distribution, Snowballing member removal, Boolean Function Simplification, tabulation method, Communication overhead
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.
R. Varalakshmi, V. Rhymend Uthariaraj, "A New Secure Multicast Key Distribution Scheme Using Tabulation Method", International Journal of Information Technology and Computer Science(IJITCS), vol.4, no.1, pp.32-39, 2012. DOI:10.5815/ijitcs.2012.01.05
A.Bellardie, ”Scalable Multicast Key Distribution” RFC 1949, May 1996
Chung Kei Wong, Mohamed Gouda, and Simon S Lam, “Secure Group Communication Using Key Graphs”, Proceedings of ACMSIGCOMM, Vancouver, British Columbia, September 1998.
I. Chang, R.Engel, D.Kandlur, D.Pendarakis and D.Daha. “Key management for secure internet multicast using Boolean function minimization technique”. ACM SIGCOMM’99, March 1999.
Debby M. Wallner, Eric J. Harder, Ryan C. Agee, “Key Management for Multicast: Issues and Architectures”, Informational RFC, draft-Wallnerkey-arch-ootxt, July 1997.
H.Harney, C.Muckenhirn, “Group Key Management Protocol (GKMP) Architecture”, RFC 2094, July 1997.
H.Harney, C.Muckenhirn, “Group Key Management Protocol (GKMP) Specifications”, RFC 2093, July 1997.
D.McGrew and A. Sherman. “Key establishment in large dynamic groups using one way function trees”, May 1998.
A. Perrig, D.Song and J.Tygar, “ELK: A new protocol for efficient large-group key distribution”. In Proceedings of the 2001 IEEE symposium on Security and Privacy, 2001.
Ran Canetti, Benny Pinkas, “A Taxonomy of Multicast security issues”, Internet Draft, May 1998.
Suvo Mittra, “Iolus: A Framework for Scalable Secure Multicasting”, Proceedings of ACMSIGCOMM’97, Cannes, France, pp. 277-288, 1997.
A.Chandha, Y.Liu and S.K.Das, “Group Key distribution via local collaboration in wireless sensor networks”, in IEEE International Conference on Sensor and AdHoc Communications and Networks(SECON), 2006.
Chaddoud, G., Chrisment, I. and Schaff, A., “Dynamic Group Communication Security”, Proc. of sixth IEEE Symposium on Computers and Communications (ISCC'01) pp 49-56, 2001.
Chang I., Engel R., Kandlur D., Pendarakis, Dimitrios., Saha, Debanjan., “Key Management For Secure Internet Multicast Using Boolean Function Minimization Technique”, Proc. of INFOCOMM’99, pp 689-698, 1999.
E.L.McCLUSKEY, Minimization of Boolean functions, Bell System Technical Journal, 35 (1959), pp. 149-175.
Moyer, M.J., Rao, J.R and Rohatgi, P., “A Survey Of Security Issues in Multicast Communications”, IEEE Networks vol. 13, pp12-23, 1999.
Roth, Charles H., Jr, “Fundamentals of Logic Design”, Fourth Edition, pp 161-167.
Setia, S., Koussih, S., Jajodia, S., and Harder, E., “Kronos: “A Scalable Group Re-keying Approach For Secure Multicast”, Proc. of 2000 IEEE Symposium on Secusrity and Privacy, pp 215-228, 2000.