MIS: Malicious nodes identification scheme in network-coding-based peer-to-peer streaming

Qiyan Wang, Long Vu, Klara Nahrstedt, Himanshu Khurana

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Network coding has been shown to be capable of greatly improving quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution attacks where malicious nodes inject into the network bogus data blocks that are combined with other legitimate blocks at downstream nodes, leading to incapability of decoding the original blocks and substantial degradation of network performance. In this paper, we propose a novel approach to limiting pollution attacks by rapidly identifying malicious nodes. Our scheme can fully satisfy the requirements of live streaming systems, and achieves much higher efficiency than previous schemes. Each node in our scheme only needs to perform several hash computations for an incoming block, incurring very small computational latency. The space overhead added to each block is only 20 bytes. The verification information given to each node is independent of the streaming content and thus does not need to be redistributed. The simulation results based on real PPLive channel overlays show that the process of identifying malicious nodes only takes a few seconds even in the presence of a large number of malicious nodes.

Original languageEnglish (US)
Title of host publication2010 Proceedings IEEE INFOCOM
DOIs
StatePublished - Jun 15 2010
EventIEEE INFOCOM 2010 - San Diego, CA, United States
Duration: Mar 14 2010Mar 19 2010

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2010
CountryUnited States
CitySan Diego, CA
Period3/14/103/19/10

Fingerprint

Network coding
Management information systems
Pollution
IPTV
Network performance
Decoding
Quality of service
Degradation

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Wang, Q., Vu, L., Nahrstedt, K., & Khurana, H. (2010). MIS: Malicious nodes identification scheme in network-coding-based peer-to-peer streaming. In 2010 Proceedings IEEE INFOCOM [5462226] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2010.5462226

MIS : Malicious nodes identification scheme in network-coding-based peer-to-peer streaming. / Wang, Qiyan; Vu, Long; Nahrstedt, Klara; Khurana, Himanshu.

2010 Proceedings IEEE INFOCOM. 2010. 5462226 (Proceedings - IEEE INFOCOM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, Q, Vu, L, Nahrstedt, K & Khurana, H 2010, MIS: Malicious nodes identification scheme in network-coding-based peer-to-peer streaming. in 2010 Proceedings IEEE INFOCOM., 5462226, Proceedings - IEEE INFOCOM, IEEE INFOCOM 2010, San Diego, CA, United States, 3/14/10. https://doi.org/10.1109/INFCOM.2010.5462226
Wang Q, Vu L, Nahrstedt K, Khurana H. MIS: Malicious nodes identification scheme in network-coding-based peer-to-peer streaming. In 2010 Proceedings IEEE INFOCOM. 2010. 5462226. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2010.5462226
Wang, Qiyan ; Vu, Long ; Nahrstedt, Klara ; Khurana, Himanshu. / MIS : Malicious nodes identification scheme in network-coding-based peer-to-peer streaming. 2010 Proceedings IEEE INFOCOM. 2010. (Proceedings - IEEE INFOCOM).
@inproceedings{00dfc988ff1649e5ac25c8d9d2360e38,
title = "MIS: Malicious nodes identification scheme in network-coding-based peer-to-peer streaming",
abstract = "Network coding has been shown to be capable of greatly improving quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution attacks where malicious nodes inject into the network bogus data blocks that are combined with other legitimate blocks at downstream nodes, leading to incapability of decoding the original blocks and substantial degradation of network performance. In this paper, we propose a novel approach to limiting pollution attacks by rapidly identifying malicious nodes. Our scheme can fully satisfy the requirements of live streaming systems, and achieves much higher efficiency than previous schemes. Each node in our scheme only needs to perform several hash computations for an incoming block, incurring very small computational latency. The space overhead added to each block is only 20 bytes. The verification information given to each node is independent of the streaming content and thus does not need to be redistributed. The simulation results based on real PPLive channel overlays show that the process of identifying malicious nodes only takes a few seconds even in the presence of a large number of malicious nodes.",
author = "Qiyan Wang and Long Vu and Klara Nahrstedt and Himanshu Khurana",
year = "2010",
month = "6",
day = "15",
doi = "10.1109/INFCOM.2010.5462226",
language = "English (US)",
isbn = "9781424458363",
series = "Proceedings - IEEE INFOCOM",
booktitle = "2010 Proceedings IEEE INFOCOM",

}

TY - GEN

T1 - MIS

T2 - Malicious nodes identification scheme in network-coding-based peer-to-peer streaming

AU - Wang, Qiyan

AU - Vu, Long

AU - Nahrstedt, Klara

AU - Khurana, Himanshu

PY - 2010/6/15

Y1 - 2010/6/15

N2 - Network coding has been shown to be capable of greatly improving quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution attacks where malicious nodes inject into the network bogus data blocks that are combined with other legitimate blocks at downstream nodes, leading to incapability of decoding the original blocks and substantial degradation of network performance. In this paper, we propose a novel approach to limiting pollution attacks by rapidly identifying malicious nodes. Our scheme can fully satisfy the requirements of live streaming systems, and achieves much higher efficiency than previous schemes. Each node in our scheme only needs to perform several hash computations for an incoming block, incurring very small computational latency. The space overhead added to each block is only 20 bytes. The verification information given to each node is independent of the streaming content and thus does not need to be redistributed. The simulation results based on real PPLive channel overlays show that the process of identifying malicious nodes only takes a few seconds even in the presence of a large number of malicious nodes.

AB - Network coding has been shown to be capable of greatly improving quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution attacks where malicious nodes inject into the network bogus data blocks that are combined with other legitimate blocks at downstream nodes, leading to incapability of decoding the original blocks and substantial degradation of network performance. In this paper, we propose a novel approach to limiting pollution attacks by rapidly identifying malicious nodes. Our scheme can fully satisfy the requirements of live streaming systems, and achieves much higher efficiency than previous schemes. Each node in our scheme only needs to perform several hash computations for an incoming block, incurring very small computational latency. The space overhead added to each block is only 20 bytes. The verification information given to each node is independent of the streaming content and thus does not need to be redistributed. The simulation results based on real PPLive channel overlays show that the process of identifying malicious nodes only takes a few seconds even in the presence of a large number of malicious nodes.

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

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

U2 - 10.1109/INFCOM.2010.5462226

DO - 10.1109/INFCOM.2010.5462226

M3 - Conference contribution

AN - SCOPUS:77953307858

SN - 9781424458363

T3 - Proceedings - IEEE INFOCOM

BT - 2010 Proceedings IEEE INFOCOM

ER -