Resilient Network Coding in the Presence of Byzantine Adversaries

DOI10.1109/TIT.2008.921711MaRDI QIDQ3604533zbMATH OpenOpenAlexFDO

Authors Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Médard, 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) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62) Other types of codes (94B60)

Cited in

(10)

• An efficient MAC scheme for secure network coding with probabilistic detection
• Quantum verifiable protocol for secure modulo zero-sum randomness
• Algebraic codes for network coding
• Secure Error-Correction Network Coding in a Randomized Setting
• Information security in a random network coding network
• Network information flow
• Codes in the sum-rank metric: fundamentals and applications
• Quantum network code for multiple-unicast network with quantum invertible linear operations
• Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
• A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks

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)