Nonlinear network coding is necessary to combat general Byzantine attacks

Authors:
Oliver Kosut;Lang Tong;David Tse
Affiliations:
Cornell University, Ithaca, NY;Cornell University, Ithaca, NY;University of California, Berkeley, CA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 2
Cited 1

The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Network information flow

IEEE Transactions on Information Theory

On the practicality of cryptographic defences against pollution attacks in wireless network coding

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of achieving capacity through network coding when some of the nodes act covertly as Byzantine adversaries. For several case-study networks, we investigate rates of reliable communication through network coding and upper bounds on capacity. We show that linear codes are inadequate in general, and a slight augmentation of the class of linear codes can increase throughput. Furthermore, we show that even this nonlinear augmentation may not be enough to achieve capacity. We introduce a new class of codes known as bounded-linear that make use of distributions defined over bounded sets of integers subject to linear constraints using real arithmetic.