SELF ORGANIZING TRUST MODEL FOR PEER-PEER SYSTEM
2
Author(s):
DR. SOHAN KUMAR GUPAT , LOKESH. M. R
Vol - 7, Issue- 1 ,
Page(s) : 13 - 21
(2016 )
DOI : https://doi.org/10.32804/IRJMST
Abstract
Open nature of peer-to-peer systems exposes them to malicious activity. Building trust relationships among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions and recommendations. Peers create their own trust network in their proximity by using local information available and do not try to learn global trust information. Two contexts of trust, service, and recommendation contexts are defined to measure trustworthiness in providing services and giving recommendations. Interactions and recommendations are evaluated based on importance, recentness, and peer satisfaction parameters. Additionally, recommender’s trustworthiness and confidence about a recommendation are considered while evaluating recommendations. Simulation experiments on a file sharing application show that the proposed model can mitigate attacks on 16 different malicious behaviour models. In the experiments, good peers were able to form trust relationships in their proximity and isolate malicious peers.
- AhmetBurak Can, Member, IEEE, and Bharat Bhargava, Fellow, IEEE-“SORT: A Self-ORganizing Trust Model for Peer-to-Peer Systems”- IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 10, NO. 1, JANUARY/FEBRUARY 2013.
- R. Zhou and K. Hwang, “Powertrust: A Robust and ScalableReputation System for Trusted Peer-to-Peer Computing,” IEEETrans. Parallel and Distributed Systems, vol. 18, no. 4, pp. 460-473,Apr. 2007.
- F. Cornelli, E. Damiani, S.D.C. di Vimercati, S. Paraboschi, and P.Samarati, “Implementing a Reputation-Aware Gnutella Servent,”Proc. Networking 2002 Workshops Web Eng. and Peer-to-PeerComputing, 2002.
- B. Yu, M.P. Singh, and K. Sycara, “Developing Trust in Large-Scale Peer-to-Peer Systems,” Proc. IEEE First Symp. Multi-AgentSecurity and Survivability, 2004.
- S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “RandomizedGossip Algorithms,” IEEE/ACM Trans. Networking, vol. 52, no. 6,pp. 2508-2530, June 2006.
|