skip to main content
10.1145/1456377.1456387acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Robust content-driven reputation

Published: 27 October 2008 Publication History

Abstract

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.

References

[1]
B.T. Adler, J. Benterou, K. Chatterjee, L. de Alfaro, I. Pye, and V. Raman. Assigning trust to Wikipedia content. Technical Report UCSC-CRL-07-09, School of Engineering, University of California, Santa Cruz, CA, USA, 2007.
[2]
B.T. Adler and L. de Alfaro. A content-driven reputation system for the Wikipedia. In Proc. of the 16th Intl. World Wide Web Conf. (WWW 2007). ACM Press, 2007.
[3]
Wikipedia article:. Flagged revisions / Sighted versions, 2008.
[4]
A. Cheng and E. Friedman. Sybilproof reputation mechanisms. In Proc. of the ACM SIGCOMM workshop on Economics of peer-to-peer systems. ACM Press, 2005.
[5]
E.H. Clarke. Multipart pricing of public goods. Public Choice, 8:17--33, 1971.
[6]
G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. ACM Trans. Algorithms, 3(1):2, 2007.
[7]
J.R. Douceur. The sybil attack. In Peer-to-Peer Systems: First Intl. Workshop, volume 2429 of Lect. Notes in Comp. Sci., pages 251--260, 2002.
[8]
T. Groves. Incentive in teams. Econometrica, 41(4):617--631, 1973.
[9]
K. Hoffman, D. Zage, and C. Nita--Rotaru. A survey of attack and defense techniques for reputation systems. Technical Report CSD TR #07-013, Purdue University, 2007.
[10]
A. Kittur, B. Suh, B.A. Pendelton, and E.H. Chi. He says, she says: Conflict and coordination in Wikipedia. In Proc. of CHI, 2007.
[11]
B.N. Levine, C. Shields, and N.B. Margolin. A survey of solutions to the sybil attack. Technical Report Technical Report 2006--052, Univ. of Massachussets Amherst, 2006.
[12]
M.J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994.
[13]
R. Priedhorsky, J. Chen, S. K. Lam, K. Panciera, L. Terveen, and J. Riedl. Creating, destroying, and restoring value in wikipedia. In GROUP '07: Proceedings of the 2007 international ACM conference on Supporting group work, pages 259--268, New York, NY, USA, 2007. ACM.
[14]
J.--M. Seigneur, A. Gray, and C.D. Jensen. Trust transfer: Encouraging self-recommendations without sybil attack. In Trust Management, volume 3477 of Lect. Notes in Comp. Sci. Springer-Verlag, 2005.
[15]
W.F. Tichy. The string-to-string correction problem with block move. ACM Trans. on Computer Systems, 2(4), 1984.
[16]
W. Vickrey. Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16:8--37, 1961.
[17]
F. Viégas, M. Wattenberg, and K. Dave. Studying cooperation and conflict between authors with history flow visualizations. In Proc. of the SIGCHI Conf. on Human Factors in Computing Systems, pages 575--582, 2004.
[18]
Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168--173, 1974.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
AISec '08: Proceedings of the 1st ACM workshop on Workshop on AISec
October 2008
84 pages
ISBN:9781605582917
DOI:10.1145/1456377
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 October 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. reputation
  2. user-generated content
  3. wikipedia

Qualifiers

  • Research-article

Conference

CCS08
Sponsor:

Acceptance Rates

AISec '08 Paper Acceptance Rate 9 of 20 submissions, 45%;
Overall Acceptance Rate 94 of 231 submissions, 41%

Upcoming Conference

CCS '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2016)Reputation in an open source software communityDecision Support Systems10.1016/j.dss.2016.08.00491:C(103-112)Online publication date: 1-Nov-2016
  • (2014)Multidimensional Approach to Reliability Evaluation of Information SourcesInformation Evaluation10.1002/9781118899151.ch5(129-159)Online publication date: 7-Jan-2014
  • (2013)Content-Driven Reputation for Collaborative Systems8th International Symposium on Trustworthy Global Computing - Volume 835810.1007/978-3-319-05119-2_1(3-13)Online publication date: 30-Aug-2013
  • (2012)Leveraging editor collaboration patterns in wikipediaProceedings of the 23rd ACM conference on Hypertext and social media10.1145/2309996.2310001(13-22)Online publication date: 25-Jun-2012
  • (2012)Collaborative trust evaluation for wiki securityProceedings of the 2012 Tenth Annual International Conference on Privacy, Security and Trust (PST)10.1109/PST.2012.6297938(176-184)Online publication date: 16-Jul-2012
  • (2011)Using domain ontologies for finding experts in corporate wikisProceedings of the 7th International Conference on Semantic Systems10.1145/2063518.2063527(63-70)Online publication date: 7-Sep-2011
  • (2011)Reputation systems for open collaborationCommunications of the ACM10.1145/1978542.197856054:8(81-87)Online publication date: 1-Aug-2011
  • (2011)Gist of a Thread in Social Network Services Based on Credibility of WikipediaProceedings of the 2011 44th Hawaii International Conference on System Sciences10.1109/HICSS.2011.213(1-10)Online publication date: 4-Jan-2011
  • (2011)Credibility Assessment Using Wikipedia for Messages on Social Network ServicesProceedings of the 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing10.1109/DASC.2011.149(887-894)Online publication date: 12-Dec-2011
  • (2011)The Gene Wiki in 2011: community intelligence applied to human gene annotationNucleic Acids Research10.1093/nar/gkr92540:D1(D1255-D1261)Online publication date: 9-Nov-2011
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media