Rateless and pollution-attack-resilient network coding

Wentao Huang; Ting Wang; Xin Hu; Jiyong Jang; Theodoros Salonidis

doi:10.1109/ISIT.2015.7282931

Rateless and pollution-attack-resilient network coding

Wentao Huang, Ting Wang, Xin Hu, Jiyong Jang, Theodoros Salonidis

College of Information Sciences and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

Consider the problem of reliable multicast over a network in the presence of adversarial errors. In contrast to traditional network error correction codes designed for a given network capacity and a given number of errors, we study an arguably more realistic setting that prior knowledge on the network and adversary parameters is not available. For this setting we propose efficient and throughput-optimal error correction schemes, provided that the source and terminals share randomness that is secret form the adversary. We discuss an application of cryptographic pseudorandom generators to efficiently produce the secret randomness, provided that a short key is shared between the source and terminals. Finally we present a secure key distribution scheme for our network setting.

Original language	English (US)
Title of host publication	Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2623-2627
Number of pages	5
ISBN (Electronic)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282931
State	Published - Sep 28 2015
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2015-June
ISSN (Print)	2157-8095

Other

Other	IEEE International Symposium on Information Theory, ISIT 2015
Country/Territory	Hong Kong
City	Hong Kong
Period	6/14/15 → 6/19/15

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2015.7282931

Cite this

Huang, W., Wang, T., Hu, X., Jang, J., & Salonidis, T. (2015). Rateless and pollution-attack-resilient network coding. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 2623-2627). Article 7282931 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282931

@inproceedings{cc6ae9add4df42c8bf2aaab2b7062677,

title = "Rateless and pollution-attack-resilient network coding",

abstract = "Consider the problem of reliable multicast over a network in the presence of adversarial errors. In contrast to traditional network error correction codes designed for a given network capacity and a given number of errors, we study an arguably more realistic setting that prior knowledge on the network and adversary parameters is not available. For this setting we propose efficient and throughput-optimal error correction schemes, provided that the source and terminals share randomness that is secret form the adversary. We discuss an application of cryptographic pseudorandom generators to efficiently produce the secret randomness, provided that a short key is shared between the source and terminals. Finally we present a secure key distribution scheme for our network setting.",

author = "Wentao Huang and Ting Wang and Xin Hu and Jiyong Jang and Theodoros Salonidis",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282931",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2623--2627",

booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",

address = "United States",

note = "IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

}

Huang, W, Wang, T, Hu, X, Jang, J & Salonidis, T 2015, Rateless and pollution-attack-resilient network coding. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282931, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers Inc., pp. 2623-2627, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282931

Rateless and pollution-attack-resilient network coding. / Huang, Wentao; Wang, Ting; Hu, Xin et al.
Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 2623-2627 7282931 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Rateless and pollution-attack-resilient network coding

AU - Huang, Wentao

AU - Wang, Ting

AU - Hu, Xin

AU - Jang, Jiyong

AU - Salonidis, Theodoros

PY - 2015/9/28

Y1 - 2015/9/28

N2 - Consider the problem of reliable multicast over a network in the presence of adversarial errors. In contrast to traditional network error correction codes designed for a given network capacity and a given number of errors, we study an arguably more realistic setting that prior knowledge on the network and adversary parameters is not available. For this setting we propose efficient and throughput-optimal error correction schemes, provided that the source and terminals share randomness that is secret form the adversary. We discuss an application of cryptographic pseudorandom generators to efficiently produce the secret randomness, provided that a short key is shared between the source and terminals. Finally we present a secure key distribution scheme for our network setting.

AB - Consider the problem of reliable multicast over a network in the presence of adversarial errors. In contrast to traditional network error correction codes designed for a given network capacity and a given number of errors, we study an arguably more realistic setting that prior knowledge on the network and adversary parameters is not available. For this setting we propose efficient and throughput-optimal error correction schemes, provided that the source and terminals share randomness that is secret form the adversary. We discuss an application of cryptographic pseudorandom generators to efficiently produce the secret randomness, provided that a short key is shared between the source and terminals. Finally we present a secure key distribution scheme for our network setting.

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

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

U2 - 10.1109/ISIT.2015.7282931

DO - 10.1109/ISIT.2015.7282931

M3 - Conference contribution

AN - SCOPUS:84969790453

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2623

EP - 2627

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -

Rateless and pollution-attack-resilient network coding

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this