In this paper, we focus on tradeoffs between storage cost and rekeying cost for secure multi-cast. Specifically, we present a family of algorithms that provide a tradeoff between the number of keys maintained by users and the time required for rekeying due to revocation of multiple users. We show that some well known algorithms in the literature are members of this family. We show that algorithms in this family can be used to reduce the cost of rekeying by 43%−79% when compared with previous solutions while keeping the number of keys manageable. We also describe a scheme that allows one to reduce the number of keys further without increasing the rekeying cost
In secure group communications, there are both rekey and data traffic. We propose to use application...
Developing scalable infrastructure services for secure multicast communications has been an active r...
Abstract — Group key management (GKM) in mobile communication is important to enable access control ...
Scalable group rekeying schemes proposed in the literature can be classified into two categories: st...
Security is vital for many multicast-based application and services. Secure group key management is ...
An imperative issue for secure gathering openness is of the utmost importance dissemination. The maj...
This paper brings up a new concern regarding efficient re-keying of large groups with dynamic member...
. We consider re-keying protocols for secure multicasting in a dynamic multicast group with a center...
IP multicast is an efficient solution for group communication over the Internet, as both the sender ...
An ever-increasing number of Internet applications, such as content and software distribution, dista...
Abstract: Logical Key Hierarchy (LKH) is a basic method in secure multicast group rekeying. LKH main...
Recent literature presents several rooted tree based member deletion/revocation schemes trying to si...
This paper proposes a "Minimum Redundancy Tree" (MRT) for key distribution in secure multicast. The ...
textIn secure group communications, group users share a symmetric key, called group key. The group ...
Recent literature presents several rooted tree based member deletion/revocation schemes [20, 21, 22,...
In secure group communications, there are both rekey and data traffic. We propose to use application...
Developing scalable infrastructure services for secure multicast communications has been an active r...
Abstract — Group key management (GKM) in mobile communication is important to enable access control ...
Scalable group rekeying schemes proposed in the literature can be classified into two categories: st...
Security is vital for many multicast-based application and services. Secure group key management is ...
An imperative issue for secure gathering openness is of the utmost importance dissemination. The maj...
This paper brings up a new concern regarding efficient re-keying of large groups with dynamic member...
. We consider re-keying protocols for secure multicasting in a dynamic multicast group with a center...
IP multicast is an efficient solution for group communication over the Internet, as both the sender ...
An ever-increasing number of Internet applications, such as content and software distribution, dista...
Abstract: Logical Key Hierarchy (LKH) is a basic method in secure multicast group rekeying. LKH main...
Recent literature presents several rooted tree based member deletion/revocation schemes trying to si...
This paper proposes a "Minimum Redundancy Tree" (MRT) for key distribution in secure multicast. The ...
textIn secure group communications, group users share a symmetric key, called group key. The group ...
Recent literature presents several rooted tree based member deletion/revocation schemes [20, 21, 22,...
In secure group communications, there are both rekey and data traffic. We propose to use application...
Developing scalable infrastructure services for secure multicast communications has been an active r...
Abstract — Group key management (GKM) in mobile communication is important to enable access control ...