Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Choosing reputable servents in a P2P network
Proceedings of the 11th international conference on World Wide Web
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
A reputation-based trust model for peer-to-peer ecommerce communities [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
WWW '05 Proceedings of the 14th international conference on World Wide Web
A gossip-based protocol to reach consensus via uninorm aggregation operator
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
A probabilistic approach for maintaining trust based on evidence
Journal of Artificial Intelligence Research
To reach consensus using uninorm aggregation operator: A gossip-based protocol
International Journal of Intelligent Systems
| Hi-index | 0.00 |
Decentralized Reputation Systems have recently emerged as a prominent method of establishing trust among self-interested agents in online environments. A key issue is the efficient aggregation of data in the system; several approaches have been proposed, but they are plagued by major shortcomings. We put forward a novel, decentralized data management scheme grounded in gossip-based algorithms. Rumor mongering is known to possess algorithmic advantages, and indeed, our framework inherits many of their salient features: scalability, robustness, globality, and simplicity. We also demonstrate that our scheme motivates agents to maintain a sparkling clean reputation, and is inherently impervious to certain kinds of attacks.