The String-to-String Correction Problem
Journal of the ACM (JACM)
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Studying cooperation and conflict between authors with history flow visualizations
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
He says, she says: conflict and coordination in Wikipedia
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A content-driven reputation system for the wikipedia
Proceedings of the 16th international conference on World Wide Web
Creating, destroying, and restoring value in wikipedia
Proceedings of the 2007 international ACM conference on Supporting group work
Trust transfer: encouraging self-recommendations without sybil attack
iTrust'05 Proceedings of the Third international conference on Trust Management
Security challenges for reputation mechanisms using online social networks
Proceedings of the 2nd ACM workshop on Security and artificial intelligence
Reputation systems for open collaboration
Communications of the ACM
Using domain ontologies for finding experts in corporate wikis
Proceedings of the 7th International Conference on Semantic Systems
Leveraging editor collaboration patterns in wikipedia
Proceedings of the 23rd ACM conference on Hypertext and social media
Hi-index | 0.02 |
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.