Robust content-driven reputation

In content-driven reputation systems for collaborative content, users gain or lose reputation according to how their contributions fare: authors of long-lived contributions gain reputation, while authors of reverted contributions lose reputation. Existing content-driven systems are prone to Sybil attacks, in which multiple identities, controlled by the same person, perform coordinated actions to increase their reputation. We show that content-driven reputation systems can be made resistant to such attacks by taking advantage of the fact that the reputation increments and decrements depend on content modifications, which are visible to all. We present an algorithm for content-driven reputation that prevents a set of identities from increasing their maximum reputation without doing any useful work. Here, work is considered useful if it causes content to evolve in a direction that is consistent with the actions of high-reputation users. We argue that the content modifications that require no effort, such as the insertion or deletion of arbitrary text, are invariably non-useful. We prove a truthfullness result for the resulting system, stating that users who wish to perform a contribution do not gain by employing complex contribution schemes, compared to simply performing the contribution at once. In particular, splitting the contribution in multiple portions, or employing the coordinated actions of multiple identities, do not yield additional reputation. Taken together, these results indicate that content-driven systems can be made robust with respect to Sybil attacks.

[1]  Krishnendu Chatterjee,et al.  Assigning trust to Wikipedia content , 2008, Int. Sym. Wikis.

[2]  Alice Cheng,et al.  Sybilproof reputation mechanisms , 2005, P2PECON '05.

[3]  Aniket Kittur,et al.  He says, she says: conflict and coordination in Wikipedia , 2007, CHI.

[4]  Cristina Nita-Rotaru,et al.  A survey of attack and defense techniques for reputation systems , 2009, CSUR.

[5]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

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

[7]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[8]  Graham Cormode,et al.  The string edit distance matching problem with moves , 2002, SODA '02.

[9]  Brian Neil Levine,et al.  A Survey of Solutions to the Sybil Attack , 2006 .

[10]  John Riedl,et al.  Creating, destroying, and restoring value in wikipedia , 2007, GROUP.

[11]  Luca de Alfaro,et al.  A content-driven reputation system for the wikipedia , 2007, WWW '07.

[12]  Walter F. Tichy,et al.  The string-to-string correction problem with block moves , 1984, TOCS.

[13]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[14]  Christian Damsgaard Jensen,et al.  Trust Transfer: Encouraging Self-recommendations Without Sybil Attack , 2005, iTrust.

[15]  E. H. Clarke Multipart pricing of public goods , 1971 .

[16]  F TichyWalter The string-to-string correction problem with block moves , 1984 .

[17]  Martin Wattenberg,et al.  Studying cooperation and conflict between authors with history flow visualizations , 2004, CHI.