Abstract
Problem statement: In a heterogeneous environment, for a secure multicast communication, the group members have to share a secret key which is used to encrypt/decrypt the secret messages among the members. The Secure Group Communication of large scale multicast group in a dynamic environment is more complex than securing one-to-one communication due to the inherent scalability issue of group key management. Since the group members are dynamic in nature such as joining or leaving the group, the key updating is performed among the valid members without interrupting the multicast session so that non group members can’t have access to the future renewed keys. Approach: The main aim is to develop a scheme which can reduce the cost of computational overhead, number of messages needed during the time of key refreshing and the number of keys stored in servers and members. The cost of establishing the key and renewal is proportionate to the size of the group and subsequently fetches a bottleneck performance in achieving scalability. By using a Cluster Based Hierarchical Key Distribution Protocol, the load of key management can be shared among dummy nodes of a cluster without revealing the group messages to them. Results: Especially, the existing model incurs a very less computational and communication overhead during renewal of keys. The proposed scheme yields better scalability because of the fact that the Key computational cost, the keys stored in key server and numbers of rekey-messages needed are very less. Conclusion: Our proposed protocol is based on Elliptic curve cryptography algorithm to form secure group key, even with smaller key size, it is capable of providing more security. This protocol can be used both in wired or wireless environments.
Highlights
The exponential growth of the Internet for the last strategy
The main aim is to elaborate how provable and promising is our proposed secure group key management protocol failure remains existing in this mode of key management
The Protocols mostly used in Centralized Group Key Management are One-way Function Tree (OFT), Logical Key Hierarchy (LKH), ELK and CFKM, GKMP, Keystone
Summary
When combined with the reliable group communication services in obtaining a cost effective computational. A group of nodes is called Cluster where one node acts as Cluster head which is responsible for some among the members, there is no entity that knows all the keys at the same time. This protocol uses the notion of sub trees agreeing on a mutual key. In key management algorithms (Prathap and Vasudevan, 2009; Poovendran and McGrew, 2004; Rafaeli and Hutchison, 2003; Zheng et al, 2006) when group membership changes, the group controller changes the keys in the key tree and securely broadcasts the new keys to other existing members. The keys known to a user depend on the type of group key management algorithm used
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.