A Robust Reputation System for P2P and Mobile Ad-hoc Networks

Reputation systems can be tricked by the spread of false reputation ratings, be it false accusations or false praise. Simple solutions such as exclusively relying on one’s own direct observations have drawbacks, as they do not make use of all the information available. We propose a fully distributed reputation system that can cope with false disseminated information. In our approach, everyone maintains a reputation rating and a trust rating about everyone else that they care about. From time to time first-hand reputation information is exchanged with others; using a modified Bayesian approach we designed and present in this paper, only second-hand reputation information that is not incompatible with the current reputation rating is accepted. Thus, reputation ratings are slightly modified by accepted information. Trust ratings are updated based on the compatibility of second-hand reputation information with prior reputation ratings. Data is entirely distributed: someone’s reputation and trust is the collection of ratings maintained by others. We enable redemption and prevent the sudden exploitation of good reputation built over time by introducing re-evaluation and reputation fading.

[1]  Evangelos Kotsovinos,et al.  Pinocchio: Incentives for Honest Participation in Distributed Trust Management , 2004, iTrust.

[2]  Boi Faltings,et al.  An incentive compatible reputation mechanism , 2003, EEE International Conference on E-Commerce, 2003. CEC 2003..

[3]  Andrew Twigg,et al.  Enforcing Collaboration in Peer-to-Peer Routing Services , 2003, iTrust.

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

[5]  Jean-Yves Le Boudec,et al.  The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks , 2003 .

[6]  Vladimiro Sassone,et al.  A formal model for trust in dynamic networks , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..

[7]  R. Dingledine,et al.  Reputation in P2P Anonymity Systems , 2003 .

[8]  Paul Resnick,et al.  Trust among strangers in internet transactions: Empirical analysis of eBay' s reputation system , 2002, The Economics of the Internet and E-commerce.

[9]  L. Mui,et al.  A computational model of trust and reputation , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

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

[11]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[12]  Gabriel Montenegro,et al.  Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Addresses , 2002, NDSS.

[13]  Audun Jøsang,et al.  AIS Electronic Library (AISeL) , 2017 .

[14]  Karl Aberer,et al.  Managing trust in a peer-2-peer information system , 2001, CIKM '01.

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

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

[17]  Chrysanthos Dellarocas,et al.  Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior , 2000, EC '00.

[18]  Giorgos Zacharia,et al.  Collaborative reputation mechanisms in electronic marketplaces , 1999, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers.

[19]  P. Kollock The Production of Trust in Online Markets , 1999 .

[20]  M. Gerla,et al.  GloMoSim: a library for parallel simulation of large-scale wireless networks , 1998, Proceedings. Twelfth Workshop on Parallel and Distributed Simulation PADS '98 (Cat. No.98TB100233).

[21]  J. Berger Statistical Decision Theory and Bayesian Analysis , 1988 .