Corrupção, Mentiras e Isolamento: avaliação de impacto de ataques a BitTorrent

• Rodrigo B. Mansilha UNISINOS
• Marlom A. Konrath UNISINOS
• Marinho P. Barcellos UNISINOS

DOI: https://doi.org/10.5753/sbseg.2007.20920

Abstract

BitTorrent has become one of the most popular Internet applications, given the number of users and the fraction of the Internet traffic it consumes. Its wide adoption has exposed potential problems, like selfish peer behavior and security vulnerabilities. Related research efforts so far have focused on modeling the dynamics of swarms and on incentive mechanisms to improve fairness without sacrificing efficiency. In a previous paper, we investigated security vulnerabilities in BitTorrent. The present paper expands the aforementioned one in several aspects. In particular, it improves the modelling of swarms, leading to more realistic results, and defines and evaluates a new attack, piece corruption. Our analysis demonstrates the seriousness of such attacks and shows the need for security countermeasure mechanisms.

References

(2007). Azureus website. http://azureus.sourceforge.net/.

(2007a). Bittorrent protocol specification v1.0. http://wiki.theory.org/BitTorrentSpecification.

(2007b). Bittorrent.org. http://www.bittorrent.org/protocol.html.

Barbera, M., Lombardo, A., Schembra, G., and Tribastone, M. (2005). A markov model of a freerider in a bittorrent P2P network. In IEEE Global Telecommunications Conference (GLOBECOM ’05), volume 2, pages 985–989, St. Louis, MO, USA.

Barcellos, M. P., Facchini, G., Muhammad, H. H., Bedin, G. B., and Luft, P. (2006). Bridging the gap between simulation and experimental evaluation in computer networks. In Simulation Symposium, 2006. 39th Annual, pages 8 pp.+.

Bharambe, A. R., Herley, C., and Padmanabhan, V. N. (2005a). Some observations on bittorrent performance. In Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (SIGMETRICS 2005), volume 33, pages 398–399, New York, NY, USA. ACM Press.

Bharambe, A. R., Herley, C., and Padmanabhan, V. N. (2005b). Understanding and deconstructing BitTorrent performance. Technical Report MSR-TR-2005-03, Microsoft Research.

Das, S., Tewari, S., and Kleinrock, L. (2006). The case for servers in a peer-to-peer world. In 2006 IEEE International Conference on Communications, volume 1, pages 331–336, Washington, DC, USA. IEEE Computer Society.

Douceur, J. R. (2002). The sybil attack. In 1st International Workshop on Peer-to-Peer Systems, pages 251–260, Cambridge, MA, USA.

Eger, K. and Killat, U. (2006). Bandwidth trading in unstructured p2p content distribution networks. In 6th IEEE International Conference on Peer-to-Peer Computing, 2006 (P2P 2006), pages 39–48, Washington, DC, USA. IEEE Computer Society.

Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., and Zhang, X. (2005). Measurements, analysis, and modeling of bittorrent-like systems. In Internet Measurement Conference (IMC ’05), pages 35–48.

Jun, S. and Ahamad, M. (2005). Incentives in BitTorrent induce free riding. In ACM SIGCOMM Workshop on Economics of Peer-to-Peer systems (P2P-ECON), pages 116–121.

Konrath, M. A., Barcellos, M. P., Silva, J. F., Gaspary, L. P., and Dreher, R. (2007). Atacando um enxame com um bando de mentirosos: vulnerabilidades em bittorrent. In XXV Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos (SBRC 2007), volume 2, pages 883–896.

Legout, A., Urvoy-Keller, G., and Michiardi, P. (2006). Rarest first and choke algorithms are enough. Technical report, INRIA.

Liogkas, N., Nelson, R., Kohler, E., and Zhang, L. (2006). Exploiting bittorrent for fun (but not profit). In 5th International Workshop on Peer-to-Peer Systems (IPTPS 2006).

Purandare, D. and Guha, R. (2006). Preferential and strata based p2p model: Selfishness to altruism and fairness. In 12th International Conference on Parallel and Distributed Systems, 2006. ICPADS 2006, volume 1, pages 561–570.

Qiu, D. and Srikant, R. (2004). Modeling and performance analysis of BitTorrent-like peer-to-peer networks. SIGCOMM Comput. Commun. Rev., 34(4):367–378.

Shneidman, J., Parkes, D., and Massoulie, L. (2004). Faithfulness in internet algorithms. In Proc. SIGCOMM Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems (PINS’04), Portland, OR, USA. ACM SIGCOMM.

Singh, A., Ngan, T.-W., Druschel, P., and Wallach, D. S. (2006). Eclipse attacks on overlay networks: Threats and defenses. In 25th Conference on Computer Communications (INFOCOM 2006). IEEE.

Veciana, G. and Yant, X. (2003). Fairness, incentives and performance in peer-to-peer networks. In Proceedings of the 41st Annual Allerton Conference on Communication, Control and Computing.

Wang, G. (2006). An efficient implementation of sha-1 hash function. In IEEE International Conference on Electro/information Technology, 2006, pages 575–579.

Yang, X. and de Veciana, G. (2004). Service capacity of peer to peer networks. In INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, volume 4, pages 2242–2252.