Abstract
The rich literature available for key management schemes for Secure Group Communication focuses on operating only a single group. We consider the operation of simultaneous/concurrent multiple groups in the Secure Group Communication model with overlapping memberships. Designing a secure key management scheme with efficient rekeying process in this scenario is a challenging task. We design an efficient secure group key management scheme for simultaneous multiple groups with overlapping memberships. We propose a new key structure called Binomial Key Tree Queue to manage the keys. Our scheme scales well as the overlapping memberships across the multiple groups increases. We compare the schemes with two schemes which have recently focused on key management protocol design for simultaneous multiple groups. The proposed scheme achieves significant reduction in rekeying cost, storage compared to these schemes. Interestingly, we achieve this efficiency in the rekeying cost without much increase in storage at user.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aparna, A., Amberker, B.B.: Secure group communication using binomial trees. In: Third International Symposium on Advanced Networks and Telecommunication Systems, IEEE ANTS (2009)
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-Secure Key Distribution for Dynamic Conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)
Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communication Using key Graphs. IEEE/ACM Transactions on Networking 8, 16–30 (2000)
Mittra, S.: Iolus: A framework for Scalable Secure Multicasting. In: ACM SIGCOMM 1997 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, vol. 27, pp. 277–288 (1997)
Amir, Y., Kim, Y., Nita-Rotaru, C., Schultz, J., Stanton, J., Tsudik, G.: Secure Group Communication using Robust Contributory Key Agreement. IEEE Transactions on Parallel and Distributed System 15, 468–480 (2004)
Burmester, M., Desmedt, Y.: A Secure and Efficient Conference Key Distribution System. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275–286. Springer, Heidelberg (1995)
Rafaeli, S., Hutchison, D.: A Survey of Key Management for Secure Group Communication. ACM Computing Surveys 35, 309–329 (2003)
Purushothama, B.R., Amberker, B.B.: Group key management scheme for simultaneous multiple groups with overlapped membership. In: Third International Conference on Communication Systems and Networks, COMSNETS, pp. 1–10 (2011)
Aparna, A., Amberker, B.B.: Key Management Scheme for Multiple Simultaneous Secure Group Communication. In: IEEE International Conference on Internet Multimedia Systems Architecture and Applications, IMSAA 2009, pp. 1–6 (2009)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. PHI Publishers, New Delhi (2006)
Aparna, A., Amberker, B.B.: A key management scheme for secure group communication using binomial key trees. International Journal of Network Management 20, 383–418 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Purushothama, B.R., Shirisha, K., Amberker, B.B. (2012). Secure Group Key Management Scheme for Simultaneous Multiple Groups with Overlapped Memberships Using Binomial Key Tree. In: Thampi, S.M., Zomaya, A.Y., Strufe, T., Alcaraz Calero, J.M., Thomas, T. (eds) Recent Trends in Computer Networks and Distributed Systems Security. SNDS 2012. Communications in Computer and Information Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34135-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-34135-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34134-2
Online ISBN: 978-3-642-34135-9
eBook Packages: Computer ScienceComputer Science (R0)