Foundations of Peer-to-Peer Reputation
- 7 December 2020
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 1st International Workshop on Distributed Infrastructure for Common Good
Abstract
Successful classification of good or bad behavior in the digital domain is limited to central governance, as can be seen with trading platforms, search engines and news feeds. We explore and consolidate existing work on decentralized reputation systems to form a common denominator for what makes a reputation system successful when applied without a centralized reputation authority, formalized in 7 axioms and 3 postulates. Reputation must start from nothing and always reward performed work, respectively lowering and increasing as work is consumed and performed. However, it is impossible for nodes to perform work in a purely synchronous attack-proof work model and real systems must necessarily employ relaxations to such a work model. We show how the relaxations of performing parallel work, allowing unconsumed work and seeding well-known identities with work satisfy our model. Our formalizations allow constraint driven design of decentralized reputation mechanisms.Keywords
This publication has 14 references indexed in Scilit:
- Sybil Defense Techniques in Online Social Networks: A SurveyIEEE Access, 2017
- Bitcoin: Benefit or Curse?IT Professional, 2014
- Principles of Eventual ConsistencyFoundations and Trends® in Programming Languages, 2014
- Taxonomy of attacks and defense mechanisms in P2P reputation systems—Lessons for reputation system designersComputer Science Review, 2012
- An analysis of social network-based Sybil defensesACM SIGCOMM Computer Communication Review, 2010
- A survey of attack and defense techniques for reputation systemsACM Computing Surveys, 2009
- Reputation-Based Trust Systems for P2P Applications: Design Issues and Comparison FrameworkLecture Notes in Computer Science, 2006
- Sybilproof reputation mechanismsPublished by Association for Computing Machinery (ACM) ,2005
- Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and ExperimentsInternet Mathematics, 2005
- The Eigentrust algorithm for reputation management in P2P networksPublished by Association for Computing Machinery (ACM) ,2003