Correction of adversarial errors in networks
Abstract
We design codes to transmit information over a network, some subset of which is controlled by a malicious adversary. The computationally unbounded, hidden adversary knows the message to be transmitted, and can observe and change information over the part of the network he controls. The network nodes do not share resources such as shared randomness or a private key. We first consider a unicast problem in a network with |E| parallel, unit-capacity, directed edges. The rate-region has two parts. If the adversary controls a fraction p < 0.5 of the |E| edges, the maximal throughput equals (1 − p)|E|. We describe low-complexity codes that achieve this rate-region. We then extend these results to investigate more general multicast problems in directed, acyclic networks.
Additional Information
© Copyright 2005 IEEE. Reprinted with permission. The authors were partially supported by NSF Grants CCR-0325324, CCR-0325673 and CCF-0346991 and a grant from the Lee Center for Advanced Networking at Caltech. We thank Yuval Ishai for pointing out the connection between our results and the known results on VSS.Files
Name | Size | Download all |
---|---|---|
md5:490db508b190b124a8a64dbe6806f449
|
245.0 kB | Preview Download |
Additional details
- Eprint ID
- 7300
- Resolver ID
- CaltechAUTHORS:JAGisit05
- Created
-
2007-01-26Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field