ACM Home Page
Please provide us with feedback. Feedback
Sybilproof reputation mechanisms
Full text PdfPdf (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
Alice Cheng  Cornell University, Ithaca, NY
Eric Friedman  Cornell University, Ithaca, NY
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 113,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080192.1080202
What is a DOI?

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
4
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

Collaborative Colleagues:
Alice Cheng: colleagues
Eric Friedman: colleagues