Byzantine modification detection in multicast networks using randomized network coding
By T. Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R Karger. International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
301 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/abe61dc442eb7f2f8d8ed52ca78a630e6b7b8313
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Brent Waters
- Dan Boneh
- Allison Bishop
- David Mandell Freeman
- Jonathan Katz
- Amit Sahai
- Xavier Boyen
- Craig Gentry
In Computer Networks and Communications
- Dan Boneh
- J. L. Boudec
- J. Widmer
- Supratim Deb
- Clifford Choute
- Christina Fragouli
- Jonathan Katz
- David Mandell Freeman
In Electrical and Electronic Engineering
- Dan Boneh
- J. Widmer
- J. L. Boudec
- Supratim Deb
- Clifford Choute
- Christina Fragouli
- Jonathan Katz
- Muriel Médard
Citations in the corpus
- Resilient Network Coding in the Presence of Byzantine Adversaries (2008, unknown): “The interplay of network coding and Byzantine adversaries was examined in [12] , which detects the existence of an adversary but does not provide an error-correction scheme.”
- Network coding: an instant primer (2006, background): “Network coding also simplifies the protection against modified packets in a network [16].”
- Algebraic gossip: a network coding approach to optimal multiple rumor mongering (2006, methodology): “The application of RLC for security has been demonstrated in [20] in a different setting.”
- Signing a Linear Subspace: Signature Schemes for Network Coding (2009, background): “Information-theoretic methods for enabling recovery from malicious faults work by introducing redundancy into the original packets transmitted by the sender [15] [17] [18].”