Key distribution protocol for secure multicast with reduced communication delay

Authors:
P. Vijayakumar;S. Bose;A. Kannan;P. H. Himesh
Affiliations:
Department of Computer Science and Engineering, Anna University, Chennai;Department of Computer Science and Engineering, Anna University, Chennai;Department of Information Science and Technology, Anna University, Chennai;Department of Information Technology, University College of Engineering Tindivanam
Venue:
AMT'11 Proceedings of the 7th international conference on Active media technology
Year:
2011

Citing 8
Cited 1

Secure group communications using key graphs

IEEE/ACM Transactions on Networking (TON)
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Key distribution for secure multimedia multicasts via data embedding

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
Computation-Efficient Multicast Key Distribution

IEEE Transactions on Parallel and Distributed Systems
Minimizing center key storage in hybrid one-way function based group key management with communication constraints

Information Processing Letters
MABS: Multicast Authentication Based on Batch Signature

IEEE Transactions on Mobile Computing
Key management and distribution for secure multimedia multicast

IEEE Transactions on Multimedia
MDS array codes with independent parity symbols

IEEE Transactions on Information Theory

Key distribution for Pay-TV system with reduced computation cost using XOR operation

ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Providing effective security with minimum communication cost in the distribution of keying material in a secure multicast communication is a challenging issue, since the amount of information sent through the wired or wireless channel is high. Moreover, the key must be sent securely to the group members. In this paper, we propose a new Key Distribution Protocol that reduces the time delay taken to distribute the keying information to receiver side. To minimize the amount of bits communicated we propose secure one way hash function in the key distribution protocol in which Euler's Totient Function θ(n) is used in the key computation process. It decrease the time delay to reach the destination by reducing the number of bits communicated while distributing the Keying and re-keying information. Two major operations in this scheme are joining and leaving operations for managing multicast group memberships. The main advantage of this approach is that it uses an existing binary tree based key management scheme to manage the keys that are generated by the GC. The performance of this approach is compared with the existing approaches in this paper and it is shown that this proposed approach takes less communication delay.