ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Full text PdfPdf (650 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 9th ACM conference on Computer and communications security table of contents
Washington, DC, USA
SESSION: Peer to peer networks table of contents
Pages: 207 - 216  
Year of Publication: 2002
ISBN:1-58113-612-9
Authors
Ernesto Damiani  DTI - Università di Milano, Crema - Italy
De Capitani di Vimercati  DEA - Università di Brescia, Brescia - Italy
Stefano Paraboschi  DEI - Politecnico di Milano, Milano - Italy
Pierangela Samarati  DTI - Università di Milano, Crema - Italy
Fabio Violante  DEI - Politecnico di Milano, Milano - Italy
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 53,   Downloads (12 Months): 291,   Citation Count: 54
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/586110.586138
What is a DOI?

ABSTRACT

Peer-to-peer (P2P) applications have seen an enormous success, and recently introduced P2P services have reached tens of millions of users. A feature that significantly contributes to the success of many P2P applications is user anonymity. However, anonymity opens the door to possible misuses and abuses, exploiting the P2P network as a way to spread tampered with resources, including Trojan Horses, viruses, and spam. To address this problem we propose a self-regulating system where the P2P network is used to implement a robust reputation mechanism. Reputation sharing is realized through a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download. This way, spreading of malicious contents will be reduced and eventually blocked. Our approach can be straightforwardly piggybacked on existing P2P protocols and requires modest modifications to current implementations.


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
2
 
3
E. Adar and B. Huberman. Free riding on gnutella. Technical report, Xerox PARC, August 2000.
 
4
 
5
6
 
7
R. Chen and W. Yeager. Poblano - a distributed trust model for peer-to-peer networks. JXTA Security Project White Paper, 2001.
8
9
 
10
 
11
 
12
C. Ellison. SPKI certificate documentation. http://www.pobox.com/~/html/spki.html.
 
13
E.J. Friedman and P. Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10(2):173--199, Summer 2001.
 
14
B. Gladman, C. Ellison, and N. Bohm. Digital signatures, certificates and electronic commerce. http://citeseer.nj.nec.com/277887.html.
15
 
16
KaZaA. http://www.kazaa.com.
 
17
18
 
19
S. Saroiu, P.K. Gummadi, and S.D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proc. of Multimedia Computing and Networking (MMCN), San Jose, CA, USA, January 2002.
 
20
 
21
The Gnutella Protocol Specification v0.4 (Document Revision 1.2), June 2001. http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf.
 
22
23
 
24

CITED BY  56

Collaborative Colleagues:
Ernesto Damiani: colleagues
De Capitani di Vimercati: colleagues
Stefano Paraboschi: colleagues
Pierangela Samarati: colleagues
Fabio Violante: colleagues