Foundations of Peer-to-Peer Reputation

Stokkink, Q.A.; Stannat, A.W.; Pouwelse, J.A.

doi:10.1145/3428662.3428790

Foundations of Peer-to-Peer Reputation

Title

Foundations of Peer-to-Peer Reputation

Author

Stokkink, Q.A. (TU Delft Dataintensive Systems)
Stannat, A.W. (TU Delft Dataintensive Systems)
Pouwelse, J.A. (TU Delft Dataintensive Systems)

Date

2020

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 attackproof 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.

Subject

Information systems
Reputation systems
Networks
Peer-to-peer networks

To reference this document use:

http://resolver.tudelft.nl/uuid:110b891d-9997-4478-9401-5c8dc1040d74

DOI

https://doi.org/10.1145/3428662.3428790

Publisher

Association for Computing Machinery (ACM), New York

ISBN

978-1-4503-8197-0

Source

DICG'20: Proceedings of the 1st International Workshop on Distributed Infrastructure for Common Good