A non-manipulable trust system based on EigenTrust

Authors:
Zoë Abrams;Robert McGrew;Serge Plotkin
Affiliations:
Computer Science Dept., Stanford University, Stanford, CA;Computer Science Dept., Stanford University, Stanford, CA;Computer Science Dept., Stanford University, Stanford, CA
Venue:
ACM SIGecom Exchanges
Year:
2005

Citing 4
Cited 5

Adaptive on-line page importance computation

WWW '03 Proceedings of the 12th international conference on World Wide Web
The Eigentrust algorithm for reputation management in P2P networks

WWW '03 Proceedings of the 12th international conference on World Wide Web
Propagation of trust and distrust

Proceedings of the 13th international conference on World Wide Web
Link analysis, eigenvectors and stability

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2

Computing trusted authority scores in peer-to-peer web search networks

AIRWeb '07 Proceedings of the 3rd international workshop on Adversarial information retrieval on the web
Online trust and reputation systems

Proceedings of the 8th ACM conference on Electronic commerce
A sybil-proof referral system based on multiplicative reputation chains

IEEE Communications Letters
Trust algorithms in P2P file sharing networks

International Journal of Internet Technology and Secured Transactions
SoFA: An expert-driven, self-organization peer-to-peer semantic communities for network resource management

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental consideration in designing successful trust scores in a peer-to-peer system is the self-interest of individual peers. We propose a strategyproof partition mechanism that provides incentives for peers to share files, is non-manipulable by selfish interests, and approximates trust scores based on EigenTrust. The basic idea behind the partition mechanism is that the peers are partitioned into peer groups and incentives are structured so that a peer only downloads from peers in one other peer group. We show that the total error in the trust values decreases exponentially with the number of peer groups. In addition to theoretically guaranteeing non-manipulability, in practice our trust system performs nearly as well as EigenTrust and has better load-balancing properties.