Resilient Network Coding in the Presence of Byzantine Adversaries
DOI10.1109/TIT.2008.921711zbMATH Open1328.94105OpenAlexW2106831077MaRDI QIDQ3604533FDOQ3604533
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
Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62) Other types of codes (94B60)
Cited In (10)
- Quantum verifiable protocol for secure modulo zero-sum randomness
- 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
- Codes in the Sum-Rank Metric: Fundamentals and Applications
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
- Title not available (Why is that?)
- Secure Error-Correction Network Coding in a Randomized Setting
- Information security in a random network coding network
- Network information flow
- Algebraic codes for network coding
This page was built for publication: Resilient Network Coding in the Presence of Byzantine Adversaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604533)
