| Sybilproof reputation mechanisms |
| Full text |
Pdf
(134 KB)
|
| Source
|
Applications, Technologies, Architectures, and Protocols for Computer Communication
archive
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
table of contents
Philadelphia, Pennsylvania, USA
SESSION: Reputations
table of contents
Pages: 128 - 132
Year of Publication: 2005
ISBN:1-59593-026-4
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 17, Downloads (12 Months): 113, Citation Count: 26
|
|
|
ABSTRACT
Due to the open, anonymous nature of many P2P networks, new identities - or sybils - may be created cheaply and in large numbers. Given a reputation system, a peer may attempt to falsely raise its reputation by creating fake links between its sybils. Many existing reputation mechanisms are not resistant to these types of strategies.Using a static graph formulation of reputation, we attempt to formalize the notion of sybilproofness. We show that there is no symmetric sybilproof reputation function. For nonsymmetric reputations, following the notion of reputation propagation along paths, we give a general asymmetric reputation function based on flow and give conditions for sybilproofness.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. Buchegger and J. Le Boudec. A robust reputation system for p2p and mobile ad-hoc networks. In Second Workshop on the Economics of Peer-to-Peer Systems, 2004.
|
| |
2
|
|
 |
3
|
Michal Feldman , Kevin Lai , Ion Stoica , John Chuang, Robust incentive techniques for peer-to-peer networks, Proceedings of the 5th ACM conference on Electronic commerce, May 17-20, 2004, New York, NY, USA
[doi> 10.1145/988772.988788]
|
 |
4
|
R. Guha , Ravi Kumar , Prabhakar Raghavan , Andrew Tomkins, Propagation of trust and distrust, Proceedings of the 13th international conference on World Wide Web, May 17-20, 2004, New York, NY, USA
[doi> 10.1145/988672.988727]
|
 |
5
|
|
| |
6
|
R. Morselli, J. Katz, and B. Bhattacharjee. A game-theoretic framework for analyzing trust-inference protocols. In Second Workshop on the Economics of Peer-to-Peer Systems, 2004.
|
| |
7
|
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. In Proceedings of the 7th International World Wide Web Conference, pages 161--172, 1998.
|
 |
8
|
|
| |
9
|
M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In Proceedings of the Second International Semantic Web Conference, pages 351--368, 2003.
|
CITED BY 26
|
|
|
|
|
Reid Andersen , Christian Borgs , Jennifer Chayes , Uriel Feige , Abraham Flaxman , Adam Kalai , Vahab Mirrokni , Moshe Tennenholtz, Trust-based recommendation systems: an axiomatic approach, Proceeding of the 17th international conference on World Wide Web, April 21-25, 2008, Beijing, China
|
|
|
|
|
|
Eric J. Friedman , Joseph Y. Halpern , Ian Kash, Efficiency and nash equilibria in a scrip system for P2P networks, Proceedings of the 7th ACM conference on Electronic commerce, p.140-149, June 11-15, 2006, Ann Arbor, Michigan, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
John Burgess , George Dean Bissias , Mark D. Corner , Brian Neil Levine, Surviving attacks on disruption-tolerant networks without authentication, Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, September 09-14, 2007, Montreal, Quebec, Canada
|
|
|
Omid Tafreschi , Dominique Mähler , Janina Fengel , Michael Rebstock , Claudia Eckert, A reputation system for electronic negotiations, Computer Standards & Interfaces, v.30 n.6, p.351-360, August, 2008
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Nguyen Tran , Bonan Min , Jinyang Li , Lakshminarayanan Subramanian, Sybil-resilient online content voting, Proceedings of the 6th USENIX symposium on Networked systems design and implementation, p.15-28, April 22-24, 2009, Boston, Massachusetts
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|