Abstract—The tremendous growth in the emerging technologies especially the increase in the bandwidth attracting the researchers for the development of new network based applications. One of the popular applications among them is the group based applications. The group based applications like e-learning, conferencing, TV over Internet, interactive gaming etc gaining popularity and influencing the life of modern people. These group based are vulnerable to many attacks. Maintaining security in multicast applications is a challenging issue. The dynamic changes in the group membership with frequent joins and evictions are the primefactor which makes the security difficult in any group based applications. Key distribution and key management is the challenging issue with any of these applications. This paper describes two novel techniques for secure distribution of the group key. The techniques proposed in this paper makes use of the hybrid key trees which allow the complete elimination of the secure channels for the distribution of the key material unlike many of the earlier proposed schemes, minimum storage requirements at each member, elimination of the chances of generation of week keys, less number of rounds and minimum computational overhead.
Index Terms—Hybrid-key trees, multicast, secure channel, computational overhead.
2D. V. Naga Raju is with Shri Vishnu Engineering College for Women, Bhimavaram A. P, India (email: nagudatla@gmail.com).
1Dr. V. Valli Kumari is with Andhra University, AU College of Engineering, Visakhapatnam, A. P, India (email: vallikumari@gmail.com).
1Dr. K. V. S. V. N. Raju is with Andhra University, AU College of Engineering, Visakhapatnam, A. P, India (email: kvsvn.raju@gmail.com).
Cite: D. V. Naga Raju, V. Valli Kumari and K. V. S. V. N. Raju, "Efficient Distribution of Conference Key for Dynamic Groups," International Journal of Computer Theory and Engineering vol. 2, no. 4, pp. 559-563, 2010.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
