Foundations of Peer-to-Peer Reputation

Conference paper (2020)

Authors

Q.A. Stokkink Data-Intensive Systems - EEMCS
A.W. Stannat Data-Intensive Systems - EEMCS
J.A. Pouwelse Data-Intensive Systems - EEMCS
Research Group
Data-Intensive Systems (EEMCS) (TU Delft)
Copyright: © 2020 Q.A. Stokkink, A.W. Stannat, J.A. Pouwelse
DOI: https://doi.org/10.1145/3428662.3428790
Networks Information systems Reputation systems Peer-to-peer networks
More Info
expand_more

Published Date

2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Data-Intensive Systems

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.