For Project Enquiry +91 9791 044 044

Efficient Rekeying Framework for Secure Multicast with Diverse Subscription-Period Mobile Users

ABSTRACT

 We propose a new GKM (Group key management) framework for the environment with dynamic mobile subscribers. Previously, group members have the same leaving probabilities and that the tree is balanced and complete, these assumptions are impractical. It’s might applicable for only a specific number of users. In our approach, we first compute the exact communication cost for the general key-tree. On the basis of the accurate communication cost, we propose two algorithms: one for initial key-tree construction and the other for optimizing the key-tree when the group membership changes.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING CONCEPT:-  Assumed the special case that all members have the same leaving probability, which is an impractical assumption.     GKM with a balanced and complete key-tree structure can achieve optimal performance may have limited application.	PROPOSED CONCEPT:- We propose new framework for optimal GKM with dynamic mobile subscribers.   First we build initial key-tree construction and optimizing the key-tree when the group membership changes.
EXISTING ALGORITHM:- RFC 2627 algorithm    departure dependent key topology (DDKT)	PROPOSED ALGORITHM:-        Initial construction algorithm Key-tree optimization algorithm
ALGORITHM DEFINITION:- Describes one Group Membership Management protocol that allows selective key updates To members to efficiently remove a member from the group.	ALGORITHM DEFINITION:- The initial construction algorithms proposed for generating a balanced and complete key-tree structure. key-tree optimization algorithms that maintain as balanced and complete a tree structure as possible after group membership changes
DRAWBACKS:- Applicable for specific number of users. Does not efficient with subscribers dynamically	ADVANTAGES:- Any number of users in a dynamic group. Users can subscribe and unsubscribe dynamically.