Rateless and pollution-attack-resilient network coding

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

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

2 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2623-2627
Number of pages5
ISBN (Electronic)9781467377041
DOIs
StatePublished - Sep 28 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: Jun 14 2015Jun 19 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June
ISSN (Print)2157-8095

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period6/14/156/19/15

Fingerprint

Network coding
Network Coding
Error correction
Pollution
Attack
Error Correction
Randomness
Throughput
Pseudorandom Generator
Key Distribution
Multicast
Prior Knowledge

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

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). [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
Huang, Wentao ; Wang, Ting ; Hu, Xin ; Jang, Jiyong ; Salonidis, Theodoros. / Rateless and pollution-attack-resilient network coding. Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 2623-2627 (IEEE International Symposium on Information Theory - Proceedings).
@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 = "9",
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",

}

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; Jang, Jiyong; Salonidis, Theodoros.

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

ER -

Huang W, Wang T, Hu X, Jang J, Salonidis T. Rateless and pollution-attack-resilient network coding. In 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). https://doi.org/10.1109/ISIT.2015.7282931