Resilient Network Coding in the Presence of Byzantine Adversaries

DOI10.1109/TIT.2008.921711zbMath1328.94105OpenAlexW2106831077MaRDI QIDQ3604533

Tracey Ho, Sachin Katti, Muriel Médard, Dina Katabi, Sidharth Jaggi, Michael Langberg, Michelle Effros

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.921711

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other types of codes (94B60) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

Information security in a random network coding network ⋮ Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty ⋮ Unnamed Item ⋮ A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks ⋮ An efficient MAC scheme for secure network coding with probabilistic detection ⋮ Algebraic codes for network coding ⋮ Secure Error-Correction Network Coding in a Randomized Setting ⋮ Network information flow ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

This page was built for publication: Resilient Network Coding in the Presence of Byzantine Adversaries