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.
Additional Information
© 2015 IEEE. This research was partially sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defense and was accomplished under Agreement Number W911NF-06-3-0001. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defense or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.Additional details
- Eprint ID
- 60878
- DOI
- 10.1109/ISIT.2015.7282931
- Resolver ID
- CaltechAUTHORS:20151007-140543269
- W911NF-06-3-0001
- Army Research Laboratory
- Ministry of Defence (UK)
- Created
-
2015-10-07Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field