Incentive-Based Robust Reputation Mechanism for P2P Services

Emmanuelle Anceaume (1, 2) , Aina Ravoaja (3)

1 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
2 CIDER
3 ADEPT - Algorithms for Dynamic Dependable Systems

In this paper, we address the problem of designing a robust reputation mechanism for peer-to-peer services. The mechanism we propose achieves high robustness against malicious peers (from individual or collusive ones) and provides incentive for participation. We show that the quality of the reputation value of trustworthy and participating peers is always better than the one of cheating and non participating ones. Finally we formally prove that, even when a high fraction of peers of the system exhibits a collusive behavior, a correct peer can still compute an accurate reputation mechanism towards a server, at the expense of a reasonable convergence time.

Mots clés: Reputation; distributed systems; Byzantine behaviors

Domaines: Informatique et théorie des jeux [cs.GT]

Emmanuelle Anceaume, Aina Ravoaja. Incentive-Based Robust Reputation Mechanism for P2P Services. International Conference on Principles of Distributed Systems (OPODIS), 2006, France. pp.12. ⟨hal-00916744⟩