ACM Home Page
Please provide us with feedback. Feedback
Fighting peer-to-peer SPAM and decoys with object reputation
Full text PdfPdf (122 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: 138 - 143  
Year of Publication: 2005
ISBN:1-59593-026-4
Authors
Kevin Walsh  Cornell University, Ithaca, NY
Emin Gün Sirer  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): 94,   Citation Count: 11
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.1080204
What is a DOI?

ABSTRACT

Peer-to-peer filesharing is now commonplace and its traffic now dominates bandwidth consumption at many Internet peering points. Recent studies indicate that much of this filesharing activity involves corrupt and polluted files. This paper describes Credence, a new object-based reputation system, and shows how it can counteract content pollution in peer-to-peer filesharing networks. Credence allows honest peers to assess the authenticity of online content by securely tabulating and managing endorsements from other peers. We employ a novel voter correlation scheme to weigh the opinions of peers, which gives rise to favorable incentives and system dynamics. We present simulation results indicating that our system is scalable, efficient, and robust.


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.-Y. L. Boudec. A Robust Reputation System for P2P and Mobile Ad-hoc Networks. In Workshop on the Economics of Peer-to-Peer Systems, Boston, MA, June 2004.
2
3
 
4
Credence. http://www.cs.cornell.edu/People/egs/credence/.
 
5
N. Curtis, R. Safavi-Naini, and W. Susilo. X2Rep: Enhanced Trust Semantics for the XRep Protocol. In Applied Cryptography and Network Security, Yellow Mountain, China, June 2004.
6
 
7
 
8
 
9
F. L. Fessant, S. Handurukande, A.-M. Kermarrec, and L. Massoulié. Clustering in Peer-to-Peer File Sharing Workloads. In International Workshop on Peer-to-Peer Systems, La Jolla, CA, February 2004.
10
11
12
13
 
14
J. Liang, R. Kumar, Y. Xi, and K. W. Ross. Pollution in P2P File Sharing Systems. In IEEE INFOCOM, Miami, FL, March 2005.
 
15
LimeWire. http://www.limewire.com/.
 
16
MojoNation. http://www.mojonation.net/.
17
 
18
S. Saroiu, K. P. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Multimedia Computing and Networking, San Jose, CA, January 2002.
 
19
V. Vishnumurthy, S. Chandrakumar, and E. G. Sirer. KARMA: A Secure Economic Framework for P2P Resource Sharing. In Workshop on the Economics of Peer-to-Peer Systems, Berkeley, CA, June 2003.
 
20
21
 
22
 
23
H. Zhang, A. Goel, R. Govindan, K. Mason, and B. V. Roy. Making Eigenvector-Based Reputation Systems Robust To Collusion. In Workshop on Algorithms and Models for the Web-Graph, Rome, Italy, October 2004.

CITED BY  11

Collaborative Colleagues:
Kevin Walsh: colleagues
Emin Gün Sirer: colleagues