Efficient security mechanisms for overlay multicast-based content distribution

Sencun Zhu, Chao Yao, Donggang Liu, Sanjeev Setia, Sushil Jajodia

Research output: Contribution to journalConference article

5 Citations (Scopus)

Abstract

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. 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.

Original languageEnglish (US)
Pages (from-to)40-55
Number of pages16
JournalLecture Notes in Computer Science
Volume3531
StatePublished - Oct 17 2005
EventThird International Conference on Applied Cryptography and Network Security, ACNS 2005 - New York, NY, United States
Duration: Jun 7 2005Jun 10 2005

Fingerprint

Content Distribution
Overlay networks
Multicast
Overlay
Access control
Key Management
Access Control
Vertex of a graph
Real-time Data
Multimedia Streaming
Websites
Key Distribution
Scale-up
Overlay Networks
Topology
Bandwidth
Update
Integrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Zhu, Sencun ; Yao, Chao ; Liu, Donggang ; Setia, Sanjeev ; Jajodia, Sushil. / Efficient security mechanisms for overlay multicast-based content distribution. In: Lecture Notes in Computer Science. 2005 ; Vol. 3531. pp. 40-55.
@article{a0ed4e11242246aeb7a08857faef9b71,
title = "Efficient security mechanisms for overlay multicast-based content distribution",
abstract = "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. 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.",
author = "Sencun Zhu and Chao Yao and Donggang Liu and Sanjeev Setia and Sushil Jajodia",
year = "2005",
month = "10",
day = "17",
language = "English (US)",
volume = "3531",
pages = "40--55",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

Efficient security mechanisms for overlay multicast-based content distribution. / Zhu, Sencun; Yao, Chao; Liu, Donggang; Setia, Sanjeev; Jajodia, Sushil.

In: Lecture Notes in Computer Science, Vol. 3531, 17.10.2005, p. 40-55.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Efficient security mechanisms for overlay multicast-based content distribution

AU - Zhu, Sencun

AU - Yao, Chao

AU - Liu, Donggang

AU - Setia, Sanjeev

AU - Jajodia, Sushil

PY - 2005/10/17

Y1 - 2005/10/17

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. 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. 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=26444516551&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26444516551&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:26444516551

VL - 3531

SP - 40

EP - 55

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -