Abstract
Multicast is an internetwork service that provides efficient delivery of packets from a single source to multiple recipients. When there are large number of members in the group, security and scalability problems arise and an attempt to solve this, gives rise to additional computational complexities at the server. A model is said to be highly efficient if only it has less computational complexity at the server for all membership events and highly secure only when it requires large number of computations to successfully break the multicast model. In this paper, the computational complexities are determined and analyzed for different multicast models. Theoretical evaluation and experimental results prove that for all the membership events, the recently proposed multicast model named LeaSel has computational complexity of O(NSG) when compared to other models which has computational complexity of O(N), where N ≫ NSG. It is also shown that to successfully break LeaSel, the computational complexity is O(SaN) when compared to other models whose computational complexity is O(Sn).
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
C. Wong, M. Gouda, S.S. Lam, “Secure group communication using key graphs,” IEEE/ACM Transaction on Networking, vol. 8, no. 1, Feb 2000, pp.16–30.
S. Berkovits, “How to broadcast a secret,” in advances in cryptology,EUROCRYPT91, D.W. Davis, ed. Berlin, Germany: Springer Verlag,1991, vol.547, Lecture Notes in Computer Science, pp. 535–541.
R. Elijah Blessing, V. Rhymend Uthariaraj, “LeaSel: An Efficient Key Management Model for Scalable Multicast System,” in Proc. ICORD 2002, Dec 2002.
R. Elijah Blessing, V. Rhymend Uthariaraj, “Secure and Efficient Scalable Multicast Model for Online Network Games,” in Proc. of 2 nd International Conference on Application and Development of Computer Games ADCOG 2003, pp.8–15.
A. Fiat and M. Naor, “Broadcast encryption,” in Advances in Cryptology,CRYPTO’93, D.R. Stinson, Ed. Berlin, Germany: Springer Verlag,1994,vol.773, Lecture Notes in Computer Science, pp.480–491.
D.M. Wallner, E.J. Harder and R.C. Agee, “Key management for multicast: Issues and architectures,” RFC 2627, July 1997.
R. Poovendran, S. Ahmed, S. Corson, and J. Baras, “A Scalable Extension of Group Key Management Protocol,” Technical Report TR 98-14, Institute for Systems Research, 1998.
D. Balenson, D. McGrew, and A. Sherman, “Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization,” IETF Internet draft, August 2000.
T. Dunigan and C. Cao, “Group key management,” Experimental, July 1997.
G.H. Chiou and W.T. Chen, “Secure Broadcast Using the Secure Lock,” IEEE Transactions on Software Engineering, 15(8):929–934, August 1989.
S. Mittra, “Iolus: A framework for scalable secure multicasting,” Proc. of ACM SIGCOMM’ 97, pp.277–288.
R.H. Deng, L. Gong, A.A. Lazar and W. Wang,“Authenticated key distribution and secure broadcast using no conventional encryption: A unified approach based on block codes,” in Proc.IEEE Globecom’95.Nov 1995.
H. Harney and C. Muckenhirn, “Group key management protocol (GKMP) architecture,” RFC 2094, July 1997.
Waldvogel, G. Caronni, D. Sun, N. Weiler, and B. Plattner., “The VersaKey Framework: Versatile Group Key Management,” IEEE Journal on Selected Areas in Communications. (Special Issue on Middleware), 17(8): 1614–1631, August 1999.
G. Caronni, M. Waldvogel, D. Sunand, and B. Plattner., “Efficient Security for Large and Dynamic Multicast Groups,” In Workshop on Enabling Technologies,(WETICE 98).
D.A. McGrew and A. T. Sherman. Key Establishment in Large Dynamic Groups Using One-Way Function Trees. Technical Report No. 0755, TIS labs, Inc., Glenwood, MD, May 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blessing, E.R., Uthariaraj, R. (2003). Evaluation and Analysis of Computational Complexity for Secure Multicast Models. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44843-8_75
Download citation
DOI: https://doi.org/10.1007/3-540-44843-8_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40161-2
Online ISBN: 978-3-540-44843-3
eBook Packages: Springer Book Archive