Abstract
Providing efficient security method to support the distribution of multimedia multicast is a challenging issue, since the group membership in such applications requires dynamic key generation and updation which takes more computation time. Moreover, the key must be sent securely to the group members. In this paper, we propose a new Key Distribution Protocol that provides more security and also reduces computation complexity. To achieve higher level of security, we use Euler’s Totient Function ϕ(n) and gcd(ϕ(n)) in the key distribution protocol. Therefore, it increases the key space while breaking the re-keying information. Two major operations in this scheme are joining and leaving operations for managing group memberships. An N-ary tree is used to reduce number of multiplications needed to perform the member leave operation. Using this tree, we reduce the computation time when compared with the existing key management schemes.
This is a preview of subscription content, log in via an institution to check access.
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
Li, M., Poovendran, R., McGrew, D.A.: Minimizing Center Key Storage in Hybrid One-Way Function based Group Key Management with Communication Constraints: Elsevier. Information Processing Letters, 191–198 (2004)
Lee, P.P.C., Lui, J.C.S., Yau, D.K.Y.: Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups. In: Proceedings of the IEEE International Conference on Network Protocols, p. 322 (2002)
Trappe, W., Song, J., Poovendran, R., Ray Liu, K.J.: Key Distribution for Secure Multimedia Multicasts via Data Embedding. In: IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 3, pp. 1449–1452 (2001)
Poovendran, R., Baras, J.S.: An Iinformation-Theoretic Approach for Design and Analysis of Rooted-Tree-Based Multicast Key Management Schemes. IEEE Transactions on Information Theory 47, 2824–2834 (2001)
Trappe, W., Song, J., Poovendran, R., Ray Liu, K.J.: Key Management and Distribution for Secure Multimedia Multicast. IEEE Transactions on Multimedia 5(4), 544–557 (2003)
Blaum, M., Bruck, J., Vardy, A.: MDS Array Codes with Independent Parity Symbols. IEEE Transactions on Information Theory 42(2), 529–542 (1996)
Xu, L., Huang, C.: Computation-Efficient Multicast Key Distribution. IEEE Transactions on Parallel and Distributed Systems 19(5), 577–587 (2008)
David, A., McGrew, Sherman, A.T.: Key Establishment in Large Dynamic Groups using One-Way Function Trees. Cryptographic Technologies Group, TIS Labs at Network Associates (1998)
Apostol, T.M.: Introduction to Analytic Number Theory,Springer International Students Edition, vol. 1, pp. 25–28 (1998)
Trappe, W., Washington, L.C.: Introduction to Cryptography with Coding Theory, 2nd edn., pp. 66–68. Pearson Education, London (2007)
Wong, C., Gouda, M., Lam, S.: Secure Group Communications using Key Graphs. IEEE/ACM Transactions on Networking 8, 16–30 (2000)
Zhou, Y., Zhu, X., Fang, Y.: MABS: Multicast Authentication Based on Batch Signature. IEEE Transactions on Mobile Computing 9, 982–993 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vijayakumar, P., Bose, S., Kannan, A., Subramanian, S.S. (2011). A Secure Key Distribution Protocol for Multicast Communication. In: Balasubramaniam, P. (eds) Control, Computation and Information Systems. ICLICC 2011. Communications in Computer and Information Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19263-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-19263-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19262-3
Online ISBN: 978-3-642-19263-0
eBook Packages: Computer ScienceComputer Science (R0)