Estimating the size of generalized transitive closures
VLDB '89 Proceedings of the 15th international conference on Very large data bases
ANF: a fast and scalable tool for data mining in massive graphs
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
Taxonomy of trust: categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Generalizing PageRank: damping functions for link-based ranking algorithms
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient and decentralized PageRank approximation in a peer-to-peer web search network
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Combating web spam with trustrank
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Adversarial Information Retrieval on the Web (AIRWeb 2007)
ACM SIGIR Forum
H-trust: a group trust management system for pee-to-peer desktop grid
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
Poisonedwater: An improved approach for accurate reputation ranking in P2P networks
Future Generation Computer Systems
VectorTrust: trust vector aggregation scheme for trust management in peer-to-peer networks
The Journal of Supercomputing
| Hi-index | 0.00 |
In this work we study the effectiveness of mechanisms for decentralized reputation management in P2P networks. We depart from Eigen Trust, an algorithm designed for reputation management in file sharing applications over p2p networks. EigenTrust has been proved very effective against three different natural attacks from malicious coalitions while it performs poorly on particular attack organized by two different kinds of malicious peers. We propose various metrics of reputation based on ideas recently introduced for detecting and demoting Web spam. We combine these metrics with the original EigenTrust approach. Our mechanisms are more effective than EigenTrust alone for detecting malicious peers and reducing the number of inauthentic downloads not only for all the cases previously addressed but also for more sophisticated attacks.