Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
A reputation-based trust management system for P2P networks
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Mitigating the Impact of Liars by Reflecting Peer's Credibility on P2P File Reputation Systems
Agents and Peer-to-Peer Computing
| Hi-index | 0.00 |
Since there is no method to verify the trustworthiness of shared files in P2P file sharing systems, malicious peers can spread untrustworthy files to the system. In order to prevent untrustworthy files from spreading, we propose an effective trust management scheme using peer reputation and file reputation together in a DHT-based structured P2P systems. Simulation results show that the proposed scheme effectively restrains the spreading of untrustworthy files even in cases where malicious peers change their identities. Simulation results show that the overall message cost for managing trust data is relatively low. We also propose a replication scheme so as to avoid the loss or corruption of trust data.