On counteracting Byzantine attacks in network coded peer-to-peer networks

IEEE Journal on Selected Areas in Communications

Volumn 28, Issue 5, 2010, Pages 692-702

  Kim, Min Ji ^a   Lima, Luísa ^b   Zhao, Fang ^a   Barros, João ^b   Médard, Muriel ^a   Koetter, Ralf ^c   Kalker, Ton ^d   Han, Keesook J ^e  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PORTO   (Portugal)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^d HEWLETT PACKARD LABORATORIES   (United States)

^e AIR FORCE RESEARCH LABORATORY   (United States)

Author keywords

Byzantine; Content distribution; Distributed storage; Network coding; Peer to peer; Security

Indexed keywords

BYZANTINE; CONTENT DISTRIBUTION; DISTRIBUTED STORAGE; PEER TO PEER; SECURITY;

AUTHENTICATION; BANDWIDTH; CODES (SYMBOLS); COMPUTER CRIME; DISTRIBUTED COMPUTER SYSTEMS; LINEAR NETWORKS; NETWORK CODING; PROBABILITY;

PEER TO PEER NETWORKS;

EID: 82055199252     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2010.100607     Document Type: Article

References (34)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, 2000.
2. T. Ho, M. Médard, M. Effros, and D. Karger, "The benefits of coding over routing in a randomized setting," in Proc. IEEE ISIT, Kanagawa, Japan, July 2003.
3. Z. Li and B. Li, "Network coding: the case of multiple unicast sessions," in Proc. 42nd Annual Allerton Conference on Communication Control and Computing, September 2004.
4. D. Lun, M. Médard, and R. Koetter, "Network coding for efficient wireless unicast," in Proc. International Zurich Seminar on Communications, Zurich, Switzerland, February 2006.
5. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, pp. 782-795, 2003.
6. D. Lun, M. Medard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks," Physical Communication, vol. 1, no. 1, pp. 3-20, 2008.
7. T. Ho, M. Médard, R. Koetter, M. Effros, J. Shi, and D. R. Karger, "A random linear coding approach to mutlicast," IEEE Trans. Inf. Theory, vol. 52, pp. 4413-4430, 2006. (Pubitemid 46445282)
8. S. Acedański, S. Deb, M. Médard, and R. Koetter, "How good is random linear coding based distributed network storage?" in Proc. 1st Netcod, Riva del Garda, Italy, April 2005.
9. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE INFOCOM, Miami, FL, March 2005.
10. "Bittorrent file sharing protocol," http://www.BitTorrent.com.
11. C. Gkantsidis, J. Miller, and P. Rodriguez, "Comprehensive view of a live network coding p2p system," in Proc. ACM SIGCOMM/USENIX Internet Measurement Conference, Rio de Janeiro, Brazil, October 2006.
12. R. Perlman, "Network layer protocols with Byzantine robustness," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, October 1988.
13. M. Castro and B. Liskov, "Practical Byzantine fault tolerance," in Symposium on Operating Systems Design and Implementation (OSDI), February 1999.
14. L. Lamport, R. Shostak, and M. Pease, "The Byzantine generals problem," ACM Trans. Programming Languages and Systems, vol. 4, pp. 382-401, 1982.
15. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Médard, "Resilient network coding in the presence of Byzantine adversaries," in Proc. IEEE INFOCOM, March 2007, pp. 616 - 624. (Pubitemid 47334278)
16. C. Gkantsidis and P. Rodriguez, "Cooperative security for network coding file distribution," in Proc. IEEE INFOCOM, April 2006.
17. A. Barabási and R. Albert, "Emergence of Scaling in Random Networks," Science, vol. 286, no. 5439, p. 509, 1999.
18. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, "Search in power-law networks," Phys. Rev. E, vol. 64, no. 4, p. 046135, September 2001.
19. R. Pastor-Satorras and A. Vespignani, "Epidemic spreading in scale-free networks," Phys. Rev. Lett., vol. 86, no. 14, pp. 3200-3203, Apr 2001. (Pubitemid 32317894)
20. R. M. May and A. L. Lloyd, "Infection dynamics on scale-free networks," Phys. Rev. E, vol. 64, no. 6, p. 066112, Nov 2001.
21. F. Zhao, T. Kalker, M. Médard, and K. J. Han, "Signatures for content distribution with network coding," in Proc. IEEE ISIT, June 2007.
22. M. Kim, M. Médard, and J. Barros, "Countering byzantine adversaries with network coding: An overhead analysis," in Proc. IEEE MILCOM, November 2008.
23. L. Lima, J. Barros, and R. Koetter, "Byzantine attacks against network coding in peer to peer distributed storage," in Proc. IEEE ISIT, June 2009.
24. A. G. Dimakis, P. B. Godfrey, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in Proc. IEEE INFOCOM, Anchorage, Alaska, May 2007.
25. R. W. Yeung and N. Cai, "Network error correction," Communications in Information and Systems, no. 1, pp. 19-54, 2006.
26. R. Koetter and F. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol. 54, pp. 3579-3591, 2008.
27. D. Silva and F. Kschischang, "Adversarial error correction for network coding: Models and metrics," in Proc. Annual Allerton Conf. on Commun., Control, and Computing, Monticello, IL, September 2008.
28. T. Ho, B. Leong, R. Koetter, M. Médard, and M. Effros, "Byzantine modification detection in multicast networks using randomized network coding," in Proc. IEEE ISIT, June 2004.
29. D. Charles, K. Jain, and K. Lauter, "Signatures for network coding," in Proc. Conference on Information Sciences and Systems, March 2006.
30. N. Koblitz, A. Menezes, and S. Vanstone, "The state of elliptic curve cryptography," Designs, Codes and Cryptography, vol. 19, no. 2-3, pp. 173-193, March 2000.
31. Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An efficient signaturebased scheme for securing network coding against pollution attacks," in Proceedings of IEEE INFOCOM, Pheonix, AZ, April 2008.
32. M. Krohn, M. Freedman, and D. Mazières, "On-the-fly verification of rateless erasure codes for efficient content distribution," in Proc. IEEE Symposium on Security and Privacy, May 2004.
33. National Institute of Standards and Technology, "Digital signature standard (DSS)," FIBS PUB 186-2, 2000.
34. D. Boneh and M. Franklin, "An efficient public key traitor tracing scheme," in Lecture Notes in Computer Science, vol. 1666. Springer-Verlag, 1999, pp. 338-353.