TheEigenTrustAlgorithmforReputationManagementinP2P.pptVIP

The EigenTrust Algorithm for Reputation Management in P2P Networks Sepandar D.Kamvar Mario T.Schlosser Hector Garcia-Molina Presenter: Jianming Zhou Problem Problem in P2P: Inauthentic files distributed by malicious nodes Objective: Identify the source of inauthentic files and bias against downloading from them Basic Idea Reputation System: Assign a trust value to each peer on its previous behaviors Challenges Need an distributed reputation system Success like C/S reputation system (eg. eBay) Provide comprehensive evaluation of peer Lower overhead Desired features Self-policy, i.e., no central server Maintain anonymity Robust to malicious node and sybil attack Minimal overhead EigenTrust -- Intro Basic idea Each peer has a Global Reputation given by the local trust values assigned by other peers Terminology Local trust value: cij The opinion peer i has of peer j, based on past exp. Each time peer i downloads an authentic/inauthentic file from peer j, cij increases/decreases. Global trust value: ti The trust that the entire system places in peer i More about Local trust value Normalization Otherwise, malicious peers can assign arbitrarily high local trust value to other malicious peers All cij is non-negative ci1+ci2+ci3+…+cin = 1 Local Trust Vector: ci contains all local trust values cij that peer i has of other peers j Other Approaches Foundation of EigenTrust Reply on past experience Friend-friend reference Past Experience Each peer bias choice based on its vector ci Peer with good experience will likely be selected Problem: each peer has limited past experience, knowing few other peers Friend-friend reference Ask friend opinion of other peers Weight their opinion by your trust in them Problem: various number of friends for each peer EigenTrust Combine and enhance Comprehensive, i.e., knowing all peers Lower overhead in term of computation and storage Comprehensive Iterative friend-friend reference Ask your friend: Ask their friend: Ask until all no