Byzantine modification detection in multicast networks using randomized network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 144-

  Ho, Tracey ^a   Leong, Ben ^a   Koetter, Ralf ^b   Médard, Muriel ^a   Effros, Michelle ^c   Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE FAULTS; BYZANTINE MODIFICATIONS; HASH SYMBOLS; RANDOMIZED NETWORK CODING;

CRYPTOGRAPHY; DEMODULATION; DISTRIBUTED COMPUTER SYSTEMS; FUNCTIONS; NETWORK PROTOCOLS; PACKET NETWORKS; POLYNOMIALS; PROBABILITY; SIGNAL ENCODING; THEOREM PROVING;

MULTICASTING;

EID: 5044242517     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. T. Ho, R. Koetter, M. Médard, D. R. Karger and M. Effros, "The benefits of coding over routing in a randomized setting", ISIT 2003.
2. T. Ho, M. Médard, J. Shi, M. Effros and D. R. Karger, "On randomized network coding", Allerton 2003.
3. P. A. Chou, Y. Wu and K. Jain, "Practical network coding", Allerton 2003.
4. M. Castro and B. Liskov, "Practical Byzantine Fault Tolerance", OSDI 1999.
5. K. P. Kihstrom, L. E. Moser and P. M. Melliar-Smith, "The SecureRing Protocols for Securing Group Communication", HICSS 98.