TY - GEN
T1 - Choosing reputable servents in a P2P network
AU - Cornelli, Fabrizio
AU - Damiani, Ernesto
AU - Di Vimercati, Sabrina De Capitani
AU - Paraboschi, Stefano
AU - Samarati, Pierangela
PY - 2002
Y1 - 2002
N2 - Peer-to-peer information sharing environments are increasingly gaining acceptance on the Internet as they provide an infrastructure in which the desired information can be located and downloaded while preserving the anonymity of both requestors and providers. As recent experience with P2P environments such as Gnutella shows, anonymity opens the door to possible misuses and abuses by resource providers exploiting the network as a way to spread tampered with resources, including malicious programs, such as Trojan Horses and viruses.In this paper we propose an approach to P2P security where servents can keep track, and share with others, information about the reputation of their peers. Reputation sharing is based on a distributed polling algorithm by which resource requestors can assess the reliability of perspective providers before initiating the download. The approach nicely complements the existing P2P protocols and has a limited impact on current implementations. Furthermore, it keeps the current level of anonymity of requestors and providers, as well as that of the parties sharing their view on others' reputations.
AB - Peer-to-peer information sharing environments are increasingly gaining acceptance on the Internet as they provide an infrastructure in which the desired information can be located and downloaded while preserving the anonymity of both requestors and providers. As recent experience with P2P environments such as Gnutella shows, anonymity opens the door to possible misuses and abuses by resource providers exploiting the network as a way to spread tampered with resources, including malicious programs, such as Trojan Horses and viruses.In this paper we propose an approach to P2P security where servents can keep track, and share with others, information about the reputation of their peers. Reputation sharing is based on a distributed polling algorithm by which resource requestors can assess the reliability of perspective providers before initiating the download. The approach nicely complements the existing P2P protocols and has a limited impact on current implementations. Furthermore, it keeps the current level of anonymity of requestors and providers, as well as that of the parties sharing their view on others' reputations.
KW - Credibility
KW - P2P network
KW - Polling protocol
KW - Reputation
UR - http://www.scopus.com/inward/record.url?scp=77953066525&partnerID=8YFLogxK
U2 - 10.1145/511446.511496
DO - 10.1145/511446.511496
M3 - Conference contribution
AN - SCOPUS:77953066525
SN - 1581134495
SN - 9781581134490
T3 - Proceedings of the 11th International Conference on World Wide Web, WWW '02
SP - 376
EP - 386
BT - Proceedings of the 11th International Conference on World Wide Web, WWW '02
T2 - 11th International Conference on World Wide Web, WWW '02
Y2 - 7 May 2002 through 11 May 2002
ER -