Abstract
Rapid growth of Internet spawns many group oriented multicast applications like Internet pay TV, news dissemination and stock quote system. The fortes of these applications are the support of dynamic, scalable group membership and group members are geographically divergent. As members of the group move in and out, an imperative cryptographic rekeying model should be applied to preserve the confidentiality of the group. A symmetric key called as session key is employed to defend the group communication data during transit. Forward and backward secrecy is attained by updating the session key for every change in group membership. Depends on the application immediate rekeying or batch rekeying can be used employed. The problem with the batch rekeying algorithm is to determine the pertinent batch size and the optimal time for rekeying process. The main aim is to propose a mathematical model based on queuing theory principles by considering the request for rekeying as Poisson process, rekeying service as an exponential distribution. The performance of the proposed model is analyzed using Java based simulator. By varying the arrival rate and rekeying service rate the optimal batch size can be attained. The optimal rekeying interval improves the performance of the group when the group membership grows dynamically. Reduces the long waiting time of the rekeying requests and find the best batch size for the rekeying. Proposed mathematical model analyses the various control parameters for batch rekeying and locates the best values for the batch size and interval time using the M/M/1/K model queues.
Highlights
IntroductionThe ubiquity of communication networks fortifies the key intended for the group
The foremost task of multicast key management system is the generation, distribution and updation of the sessionThe ubiquity of communication networks fortifies the key intended for the group
Forward and backward secrecy is attained by updating the session key for every change in group membership
Summary
The ubiquity of communication networks fortifies the key intended for the group. Multicasting is the cost effective means of data challenger who knows a contiguous subset of old session transfer for group communication. The backward secrecy ensures that a submissive challenger group should allow the members to join and leave cannot ascertain former session key by knowing only the randomly and it must be scalable. Forward and backward secrecies are opened to all, anyone joining in the group can access the ensured by changing the keys labeled as group rekeying group services. The security of the rekeying results in high computation and communication group is ensured by encrypting the packets anticipated overhead to the network and causes out of for the group with a shared secret called as session key.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
