Resilient network coding in the presence of Byzantine adversaries

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 616-624

  Jaggi, S ^a   Langberg, M ^a   Katti, S ^a   Ho, T ^a   Katabi, D ^a   Medard M ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECODING; INFORMATION ANALYSIS; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; SIGNAL ENCODING; TELECOMMUNICATION LINKS;

BYZANTINE NODES; DISTRIBUTED POLYNOMIAL-TIME RATE-OPTIMAL NETWORK CODES;

COMPUTER NETWORKS;

EID: 34548349361     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.78     Document Type: Conference Paper

References (29)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(5):1204-1216, July 2000.
2. N. Cai and R. W. Yeung. Secure network coding. In Proceedings of International Symposium in Information Theory and its Applications, Lausanne, Switzerland, June 2002.
3. N. Cai and R. W. Yeung. Network error correction, part 2: Lower bounds. submitted to Communications in Information and Systems, 2006.
4. D. Charles, K. Jain, and K. Lauter. Signatures for network coding. In Proceedings of the fortieth annual Conference on Information Sciences and Systems, Princeton, NJ, USA, 2006.
5. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the Association for Computing Machinery, 40(1):17-47, January 1993.
6. C. Gkantsidis and P. Rodriguez. Network coding for large scale content distribution. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), Miami, March 2005.
7. C. Gkantsidis and P. Rodriguez. Cooperative security for network coding file distribution. In Proceedings of IEEE Conference on Computer Communications (INFOCOM), Barcelona, April 2006.
8. T. Ho., R. Koetter, M. Médard, D. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In IEEE International Symposium on Information Theory (ISTT), page 442, Yokohama, July 2003.
9. T. Ho, M. Médard, J. Shi, M. Effros, and D. Karger. On randomized network coding. In Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2003.
10. T. C. Ho, B. Leong, R. Koetter, M. Médard, M. Effros, and D. R. Karger. Byzantine modification detection in multicast networks using randomized network coding. In International Symposium on Information Theory, Chicago, USA, June 2004.
11. S. Jaggi and M. Langberg. Resilient network coding in the presence of eavesdropping byzantine adversaries, submitted to ISIT, 2007.
12. S. Jaggi, M. Langberg, T. Ho, and M. Effros. Correction of adversarial errors in networks. In Proceedings of International Symposium in Information Theory and its Applications, Adelaide, Australia, 2005.
13. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, 51(6):1973-1982, June 2005.
14. A. Jiang. Network coding for joint storage and transmission with minimum cost. In Proceedings of International Symposium in Information Theory and its Applications, Seattle, Washington, USA, July 2006.
15. S. Katti, D. Katabi, W. Hu, H. S. Rahul, and M. Médard. The Importance of Being Opportunistic: Practical Network coding for Wireless Environments. In 43rd Annual Allerton Conference on Communication, Control, and Computing, Allerton, 2005.
16. S. Katti, H. Rahul, D. Katabi, W. H. M. Médard, and J. Crowcroft. XORs in the Air: Practical Wireless Network Coding. In ACM SIGCOMM, Pisa, Italy, 2006.
17. R. Koetter and F. Kschischang. Coding for errors and erasures in random network coding. Under Submission.
18. R. Koetter and M. Médard. Beyond routing: An algebraic approach to network coding. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 1, pages 122-130, 2002.
19. R. Koetter and M. Médard. An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11(5):782-795, October 2003.
20. M. N. Krohn, M. J. Freedman, and D. Mazires. On-the-fly verification of rateless erasure codes for efficient content distribution. In Proceedings of the IEEE Symposium on Security and Privacy, 2004, Oakland, California.
21. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Transactions on Information Theory, 49(2):371-381, 2003.
22. D. Lun, M. Médard, T. Ho, and R. Koetter. Network coding with a cost criterion. In Proceedings of International Symposium in Information Theory and its Applications, October 2004.
23. D. S. Lun, M. Médard, and R. Koetter. Efficient operation of wireless packet networks using network coding. In International Workshop on Convergent Technologies (IWCT), Oulu, Finland, 2005.
24. A. Pelc and D. Peleg. Broadcasting with locally bounded byzantine faults. Information Processing Letters, 93(3):109-115, February 2005.
25. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of the twenty-first annual ACM symposium on Theory of computing, pages 73-85, Seattle, Washington, United States, 1989.
26. L. Subramanian. Decentralized Security Mechanisms for Routing Protocols. PhD thesis, University of California at Berkeley, Computer Science Division, Berkeley, CA 94720, 2005.
27. H. J. Wertz. On the numerical inversion of a recurrent problem: The Vandermonde matrix. AC-10:492, Oct. 1965.
28. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In IEEE Infocom, volume 2, pages 585-594. IEEE, 2000.
29. R. W. Yeung and N. Cai. Network error correction, part 1 : Basic concepts and upper bounds. submitted to Communications in Information and Systems, 2006.