TY - JOUR
T1 - Efficient security mechanisms for overlay multicast based content delivery
AU - Zhu, Sencun
AU - Yao, Chao
AU - Liu, Donggang
AU - Setia, Sanjeev
AU - Jajodia, Sushil
N1 - Funding Information:
This work was supported in part by Army Research Office (W911NF-05-1-0270) and the National Science Foundation (CNS-0524156).
PY - 2007/2/26
Y1 - 2007/2/26
N2 - This paper studies the security issues that arise in an overlay multicast architecture where service providers distribute content such as web pages, static and streaming multimedia data, realtime stock quotes, or security updates to a large number of users. In particular, two major security problems of overlay multicast, network access control and group key management, are addressed. We first present a bandwidth-efficient scheme, called CRBR, that seamlessly integrates network access control and group key management. Performance analysis and simulation results show that our scheme incurs much smaller communication overhead than two other well-known schemes when they are directly applied in overlay multicast. Next we propose a DoS-resilient key distribution scheme, called k-RIP, that delivers updated keys to a large fraction of nodes with high probability even if an attacker can selectively compromise nodes in the multicast data delivery hierarchy and command these compromised nodes to drop keying packets. The proposed schemes do not rely on knowledge of overlay topology and can scale up to very large overlay networks.
AB - This paper studies the security issues that arise in an overlay multicast architecture where service providers distribute content such as web pages, static and streaming multimedia data, realtime stock quotes, or security updates to a large number of users. In particular, two major security problems of overlay multicast, network access control and group key management, are addressed. We first present a bandwidth-efficient scheme, called CRBR, that seamlessly integrates network access control and group key management. Performance analysis and simulation results show that our scheme incurs much smaller communication overhead than two other well-known schemes when they are directly applied in overlay multicast. Next we propose a DoS-resilient key distribution scheme, called k-RIP, that delivers updated keys to a large fraction of nodes with high probability even if an attacker can selectively compromise nodes in the multicast data delivery hierarchy and command these compromised nodes to drop keying packets. The proposed schemes do not rely on knowledge of overlay topology and can scale up to very large overlay networks.
UR - http://www.scopus.com/inward/record.url?scp=33846644358&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33846644358&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2006.10.003
DO - 10.1016/j.comcom.2006.10.003
M3 - Article
AN - SCOPUS:33846644358
SN - 0140-3664
VL - 30
SP - 793
EP - 806
JO - Computer Communications
JF - Computer Communications
IS - 4
ER -