Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
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
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Social Mechanism of Reputation Management in Electronic Communities
CIA '00 Proceedings of the 4th International Workshop on Cooperative Information Agents IV, The Future of Information Agents in Cyberspace
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Supporting Trust in Virtual Communities
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Finding Close Friends on the Internet
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Samsara: honor among thieves in peer-to-peer storage
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Trade-offs between reliability and overheads in peer-to-peer reputation tracking
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Byzantine fault tolerant public key authentication in peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Detecting malicious nodes in peer-to-peer streaming by peer-based monitoring
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A game theoretic trust model for on-line distributed evolution of cooperation inMANETs
Journal of Network and Computer Applications
A unifying framework for behavior-based trust models
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Evaluating stranger policies in P2P file-sharing systems with reciprocity mechanisms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Addressing common vulnerabilities of reputation systems for electronic commerce
Journal of Theoretical and Applied Electronic Commerce Research
Future Generation Computer Systems
| Hi-index | 0.00 |
We present a distributed scheme for trust inference in peer-to-peer networks. Our work is in the context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify non-cooperative users in NICE. We present a simulation-based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.