Developing trust in large-scale peer-to-peer systems

In peer-to-peer (P2P) systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. A peer needs reputation mechanisms to incorporate the knowledge of others to decide whether to trust another party in P2P systems. This paper discusses the design of reputation mechanisms and proposes a distributed reputation mechanism to detect malicious or unreliable peers in P2P systems. It illustrates the process for rating gathering and aggregation and presents some experimental results to evaluate the proposed approach. Moreover, it considers how to effectively aggregate noisy (dishonest or inaccurate) ratings from independent or collusive peers using weighted majority techniques. Furthermore, it analyzes some possible attacks on reputation mechanisms and shows how to defend against such attacks.

[1]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  A. Roadmapof A Roadmap of Agent Research and Development , 1995 .

[3]  Joan Feigenbaum,et al.  Decentralized trust management , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[4]  Bart Selman,et al.  Agent Amplified Communication , 1996, AAAI/IAAI, Vol. 1.

[5]  Carl M. Ellison,et al.  Establishing identity without certification authorities , 1996 .

[6]  Michael K. Reiter,et al.  Toward acceptable metrics of authentication , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).

[7]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Paul Resnick,et al.  Reputation Systems: Facilitating Trust in Internet Interactions , 2000 .

[10]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[11]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[12]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[13]  E. Friedman,et al.  The Social Cost of Cheap Pseudonyms , 2001 .

[14]  Marianne Winslett,et al.  Interoperable strategies in automated trust negotiation , 2001, CCS '01.

[15]  Ernesto Damiani,et al.  Choosing reputable servents in a P2P network , 2002, WWW.

[16]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[17]  Munindar P. Singh,et al.  An evidential model of distributed reputation management , 2002, AAMAS '02.

[18]  Ernesto Damiani,et al.  A reputation-based approach for choosing reliable resources in peer-to-peer networks , 2002, CCS '02.

[19]  Srdjan Capkun,et al.  Small worlds in security systems: an analysis of the PGP certificate graph , 2002, NSPW '02.

[20]  Joan Feigenbaum,et al.  Delegation logic: A logic-based approach to distributed authorization , 2003, TSEC.

[21]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[22]  Katia P. Sycara,et al.  Using DAML-S for P2P Discovery , 2003, International Conference on Web Services.

[23]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[24]  Munindar P. Singh,et al.  An adaptive social network for information access: Theoretical and experimental results , 2003, Appl. Artif. Intell..

[25]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

[26]  Munindar P. Singh,et al.  Detecting deception in reputation management , 2003, AAMAS '03.

[27]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[28]  Hector Garcia-Molina,et al.  Limited reputation sharing in P2P systems , 2004, EC '04.