Evaluation and Analysis of Computational Complexity for Secure Multicast Models

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 [3] 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).

[1]  Wen-Tsuen Chen,et al.  Secure Broadcasting Using the Secure Lock , 1989, IEEE Trans. Software Eng..

[2]  Eric J. Harder,et al.  Key Management for Multicast: Issues and Architectures , 1999, RFC.

[3]  Alan T. Sherman,et al.  Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization , 2000 .

[4]  Nathalie Weiler,et al.  The VersaKey framework: versatile group key management , 1999, IEEE J. Sel. Areas Commun..

[5]  T. Dunigan,et al.  Group key management , 1997 .

[6]  Hugh Harney,et al.  Group Key Management Protocol (GKMP) Architecture , 1997, RFC.

[7]  Bernhard Plattner,et al.  Efficient security for large and dynamic multicast groups , 1998, Proceedings Seventh IEEE International Workshop on Enabling Technologies: Infrastucture for Collaborative Enterprises (WET ICE '98) (Cat. No.98TB100253).

[8]  Mohamed G. Gouda,et al.  Secure group communications using key graphs , 2000, TNET.

[9]  Amos Fiat,et al.  Broadcast Encryption , 1993, CRYPTO.

[10]  Alan T. Sherman,et al.  Key Establishment in Large Dynamic Groups Using One-Way Function Trees , 2003, IEEE Trans. Software Eng..

[11]  Robert H. Deng,et al.  Authenticated key distribution and secure broadcast using no conventional encryption: a unified approach based on block codes , 1995, Proceedings of GLOBECOM '95.

[12]  R. Poovendran,et al.  A Scalable Extension of Group Key Management Protocol , 1998 .

[13]  Suvo Mittra,et al.  Iolus: a framework for scalable secure multicasting , 1997, SIGCOMM '97.

[14]  Shimshon Berkovits,et al.  How To Broadcast A Secret , 1991, EUROCRYPT.