CFP last date
20 January 2025
Reseach Article

A Reputation based System to Overcome Malicious Behavior in Peer-to-Peer Networks

by A.M. Anisul Huq, Mosharraf Hossain Khan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 128 - Number 6
Year of Publication: 2015
Authors: A.M. Anisul Huq, Mosharraf Hossain Khan
10.5120/ijca2015906545

A.M. Anisul Huq, Mosharraf Hossain Khan . A Reputation based System to Overcome Malicious Behavior in Peer-to-Peer Networks. International Journal of Computer Applications. 128, 6 ( October 2015), 1-6. DOI=10.5120/ijca2015906545

@article{ 10.5120/ijca2015906545,
author = { A.M. Anisul Huq, Mosharraf Hossain Khan },
title = { A Reputation based System to Overcome Malicious Behavior in Peer-to-Peer Networks },
journal = { International Journal of Computer Applications },
issue_date = { October 2015 },
volume = { 128 },
number = { 6 },
month = { October },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume128/number6/22874-2015906545/ },
doi = { 10.5120/ijca2015906545 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:20:39.365079+05:30
%A A.M. Anisul Huq
%A Mosharraf Hossain Khan
%T A Reputation based System to Overcome Malicious Behavior in Peer-to-Peer Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 128
%N 6
%P 1-6
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In recent times, the growth in the number of subscribers of peer to peer networks has been phenomenal. Anonymity being a character of such networks also gave rise to the number of free-riders and malicious behaviors. Though free riders consume network bandwidth and decrease the network performance by displaying selfish behavior, they are not a serious threat for the rest of the co-operative peers. Malicious peers on the other hand, spread viruses, worms, Trojans in the network, provide misleading feedback and try to disrupt the existing trust among the peers. Therefore, it is absolutely essential that a peer has reliable reputation information about other peers in order make informed decisions (e.g., who to download files from, who to serve content, which is a malicious node etc.). In this paper, we have proposed a reputation system that uses objective criteria to track each peer’s contribution in the system and allows peers to store their reputations locally. In our opinion, such measures will eventually root out malicious peers from the system.

References
  1. Karl Aberer and Zoran Despotovic. Managing trust in a peer- 2-peer information system. In Proceedings of the tenth international conference on Information and knowledge management, pages 310–317. ACM, 2001.
  2. Abiola Abimbola, Qi Shi, and Madjid Merabti. Using intrusion detection to detect malicious peer-to-peer network traffic. Proc. of PGNet, 2003.
  3. Torsten Ackemann, Cecilia Mascolo, and Wolfgang Emmerich. Lightweight incentives for peer-to-peer networks. 2003.
  4. Eytan Adar and Bernardo A Huberman. Free riding on gnutella. First Monday, 5(10), 2000.
  5. Miguel Castro, Peter Druschel, Ayalvadi Ganesh, Antony Rowstron, and Dan S Wallach. Secure routing for structured peer-to-peer overlay networks. ACM SIGOPS Operating Systems Review, 36(SI):299–314, 2002.
  6. Alice Cheng and Eric Friedman. Sybilproof reputation mechanisms. In Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 128–132. ACM, 2005.
  7. Nicolas Christin, Andreas SWeigend, and John Chuang. Content availability, pollution and poisoning in file sharing peerto- peer networks. In Proceedings of the 6th ACM conference on Electronic commerce, pages 68–77. ACM, 2005.
  8. Ernesto Damiani, De Capitani di Vimercati, Stefano Paraboschi, Pierangela Samarati, and Fabio Violante. A reputation-based approach for choosing reliable resources in peer-to-peer networks. In Proceedings of the 9th ACM conference on Computer and communications security, pages 207– 216. ACM, 2002.
  9. John R Douceur. The sybil attack. In Peer-to-peer Systems, pages 251–260. Springer, 2002.
  10. Dan Dumitriu, E Knightly, Aleksandar Kuzmanovic, Ion Stoica, and Willy Zwaenepoel. Denial-of-service resilience in peer-to-peer file sharing systems. In ACM SIGMETRICS Performance Evaluation Review, volume 33, pages 38–49. ACM, 2005.
  11. Minaxi Gupta, Paul Judge, and Mostafa Ammar. A reputation system for peer-to-peer networks. In Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video, pages 144–152. ACM, 2003.
  12. Bill Horne, Benny Pinkas, and Tomas Sander. Escrow services and incentives in peer-to-peer networks. In Proceedings of the 3rd ACM Conference on Electronic Commerce, pages 85–94. ACM, 2001.
  13. Sepandar D Kamvar, Mario T Schlosser, and Hector Garcia- Molina. The eigentrust algorithm for reputation management in p2p networks. In Proceedings of the 12th international conference on World Wide Web, pages 640–651. ACM, 2003.
  14. Sang-Rim Lee, Rob Sherwood, and Bobby Bhattacharjee. Cooperative peer groups in nice. In INFOCOM 2003. Twenty- Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, volume 2, pages 1272– 1282. IEEE, 2003.
  15. Jian Liang, Rakesh Kumar, Yongjian Xi, and Keith W Ross. Pollution in p2p file sharing systems. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, volume 2, pages 1174–1185. IEEE, 2005.
  16. Qin Lv, Pei Cao, Edith Cohen, Kai Li, and Scott Shenker. Search and replication in unstructured peer-to-peer networks. In Proceedings of the 16th international conference on Supercomputing, pages 84–95. ACM, 2002.
  17. Baptiste Pretre. Attacks on peer-to-peer networks. Dept. of Computer Science Swiss Federal Institute of Technology (ETH) Zurich Autumn, 2005.
  18. Matei Ripeanu, Ian Foster, and Adriana Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. arXiv preprint cs/0209028, 2002.
  19. Hosam Rowaihy, William Enck, Patrick McDaniel, and Thomas La Porta. Limiting sybil attacks in structured p2p networks. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, pages 2596–2600. IEEE, 2007.
  20. Stefan Saroiu, P Krishna Gummadi, and Steven D Gribble. Measurement study of peer-to-peer file sharing systems. In Electronic Imaging 2002, pages 156–170. International Society for Optics and Photonics, 2001.
  21. Subhabrata Sen and Jia Wang. Analyzing peer-to-peer traffic over large networks. In Proceedings of ACM SIGCOMM Internet Measurement Workshop, volume 257, page 258, 2002.
  22. Atul Singh, Miguel Castro, Peter Druschel, and Antony Rowstron. Defending against eclipse attacks on overlay networks. In Proceedings of the 11th workshop on ACM SIGOPS European workshop, page 21. ACM, 2004.
  23. Atul Singh et al. Eclipse attacks on overlay networks: Threats and defenses. In In IEEE INFOCOM. Citeseer, 2006.
  24. Emil Sit and Robert Morris. Security considerations for peerto- peer distributed hash tables. In Peer-to-Peer Systems, pages 261–269. Springer, 2002.
  25. Li Xiong and Ling Liu. Peertrust: Supporting reputationbased trust for peer-to-peer electronic communities. Knowledge and Data Engineering, IEEE Transactions on, 16(7):843–857, 2004.
  26. Runfang Zhou, Kai Hwang, and Min Cai. Gossiptrust for fast reputation aggregation in peer-to-peer networks. Knowledge and Data Engineering, IEEE Transactions on, 20(9):1282– 1295, 2008.
Index Terms

Computer Science
Information Sciences

Keywords

Reputation peer-to-peer network trust eclipse attack