On rekey policies for secure group applications
نویسندگان
چکیده
Secure distribution of information to authorized recipients is an important prerequisite for group applications with commercial potential. Typically in such applications data traffic is encrypted using a single key; that key in turn is distributed securely to the group using one of several mechanisms that rely on a set of “key encryption” keys assigned to each user. As users join and leave the group, members’ keysets have to be changed according to a rekey policy. The rekey policy is important because it determines the security properties provided to the application (e.g. forward/backward secrecy). In this paper we present a general model of rekey policies for large-scale applications, and use it to compare the effectiveness of policies proposed in the literature for various applications. Unlike prior work, which has focused on the cost of rekeying, our model also accounts for the cost of not rekeying. We cast existing policies in terms of our model and then propose a more flexible policy that we call exposure-oriented rekeying. We present simulation results showing that our new policy reduces the peak and variation in cost to achieve a given level of security, compared with periodic or batch-oriented rekeying policies.
منابع مشابه
Performance Analysis of Batch Rekey Algorithm for Secure Group Communications
The efficiency of rekeying is a main factor that influences the performance of secure group communications. Periodic batch rekeying for users join/leave is an effective way to improve the efficiency of rekeying. In this paper, we introduce queue theory into the batch rekey algorithm, and construct a model of batch rekey algorithm based on the queue theory. We then analyze the performance influe...
متن کاملA comparative performance analysis of reliable group rekey transport protocols for secure multicast
Scalable group rekeying is one of the important problems that needs to be addressed in order to support secure multicast communications for large and dynamic groups. One of the challenging issues that arises in scalable group rekeying is the problem of delivering the updated keys to the members of the group in a reliable and timely manner. In this paper, we present a new scalable and reliable k...
متن کاملA Peer-based Recovery Scheme for Group Rekeying in Secure Multicast
The Logical Key Hierarchy (LKH) provides a scalable and efficient way to distribute session keys to authorized group members in secure group (multicast) communication. However, because multicast is a best-effort service, it requires additional mechanism to ensure that every member receives the rekey information. To solve this problem, several FEC-based schemes have been proposed. Although these...
متن کاملKey Management for Secure Multicast over IPv6 Wireless Networks
Multicasting is an efficient method for transmission and routing of packets to multiple destinations using fewer network resources. Along with widespread deployment of wireless networks, secure multicast over wireless networks is an important and challenging goal. In this paper, we extend the scope of a recent new key distribution scheme to a security framework that offers a novel solution for ...
متن کاملSecure and Efficient Decentralized Group Key Establishment Protocol for Robust Group Communication
Now-a-days Internet has become the common media of communication. Many group communication application such as pay-per-view, stock quote distribution, voiceand video-conferencing, white-boards, distributed simulations, and replicated servers of all types, etc can easily be conducted on the Internet. For conducting such applications, group key is often needed, which can be established by group k...
متن کامل