Rateless Resilient Network Coding Against Byzantine Adversaries
Wentao Huang, Tracey Ho, Hongyi Yao, Sidharth Jaggi

TL;DR
This paper introduces rateless network coding schemes that adaptively provide reliable multicast in adversarial settings without prior knowledge of network capacity or error bounds, using secret channels or shared secrets.
Contribution
It presents novel rateless coding schemes for adversarial network errors that operate without prior knowledge, utilizing secret channels or shared secrets, and are proven to be optimal and distributed.
Findings
Decoding succeeds with high probability when received information meets the cut set bound.
Schemes are distributed, polynomial-time, and end-to-end, compatible with classical network coding.
Achieves reliability without prior knowledge of network capacity or maximum errors.
Abstract
This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors known a priori to the encoder and decoder. However, in certain practical settings it may be necessary to operate without such a priori knowledge. We present rateless coding schemes for two adversarial models, where the source sends more redundancy over time, until decoding succeeds. The first model assumes there is a secret channel between the source and the destination that the adversaries cannot overhear. The rate of the channel is negligible compared to the main network. In the second model, instead of a secret channel, the source and destination share random secrets independent of the input information. The amount of secret information required is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Full-Duplex Wireless Communications
