Group Rekeying for Secure Multicast Using Genetic Algorithm and Aco Based Approaches
ثبت نشده
چکیده
Multicasting is a service that delivers data from a source to a group of recipients which reduces the network’s bandwidth and also the transmission overhead in the sender. Privacy and authentication must be ensured in multicast distribution for applications, where it is important to restrict the set of receivers and authenticate the data source. Key management plays a significant role to ensure privacy and authentication in such applications. In order to restrict group membership and to enforce accountability of group members, applications of multicasting such as payper-view TV over Internet, secret conferencing between military agents and distribution of stock market information, to list a few examples should be designed to support a secure and dynamic mechanism for efficient key exchange when the users join in or leave the multicast group, in order to allow only the users in the group to receive the multicast transmission. Each secure multicast group is usually associated with one or more trusted servers referred to as group controllers responsible for managing membership to the group.
منابع مشابه
Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network
In mobile multihop relay (MMR) networks, Relay multicast rekeying algorithm (RMRA) is meant to ensure secure multicast communication and selective updating of keys in MMR networks. However, in RMRA, the rekeying is carried out after a specific interval of time, which cannot ensure the security for multicast communication on joining the member. Secondly, the rekeying scheme generates a huge comm...
متن کاملPerformance Optimizations for Group Key Management Schemes for Secure Multicast
Scalable group rekeying is one of the biggest challenges that need to be addressed to support secure communications for large and dynamic groups. In recent years, many group key management approaches based on the use of logical key trees have been proposed to address this issue. Using logical key trees reduces the complexity of group rekeying operation from O(N) to O(logN), where N is the group...
متن کاملAdaptive Rekeying for Secure Multicast∗
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying...
متن کاملA Lightweight Prepositioned Secret Sharing Tree for Multicast Key Management
Secure group communications are increasingly used in the continuous growth of the Internet applications. In a secure multicast environment, an identical data can be efficiently delivered from a source to multiple receivers within a dynamic group. A simple solution is to encrypt the transmitted data using a symmetric key. However, scalable group rekeying is the main challenge for large and dynam...
متن کاملOptimizing batch Rekeying interval for Secure Group Communication based on Queuing Model
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 conf...
متن کامل