The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Extracting reputation in multi agent systems by means of social network topology
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Trusting Information Sources One Citizen at a Time
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
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
Supporting Trust in Virtual Communities
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Emergent properties of referral systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Trusting Groups in Coalition Formation Using Social Distance
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Agent roles for context-aware p2p systems
AP2PC'08 Proceedings of the 7th international conference on Agents and Peer-to-Peer Computing
| Hi-index | 0.00 |
Although P2P systems are usually used for informationexchange between peers, they have either protectedpeers' anonymity, or required transacting peers to trusteach other implicitly. Both these approaches arevulnerable to attacks by malicious peers who could abusethe P2P system to spread viruses, incorrect, or damaginginformation.In this paper, we propose an approach for trustmanagement in P2P systems. We introduce an optimisticrole-based model for trust amongst peers and show that itis scalable, dynamic, revocable, secure and transitive.Our proposed solution permits asymmetric trustrelationships that can be verified by any peer in thesystem through a simple, low-cost algorithm. This paperintroduces a metric known as iComplex that combines apeer's trust value for each of its roles into a single,relative, probabilistic guarantee of trust. Finally, wediscuss how our trust model allows peers to revokerelationships with malicious peers, and the non-repudiation of peer relations.We use simulations to illustrate the trust valuedistribution amongst peers in the network. Our analysisand experiments demonstrates the low-cost involved toverify and validate trust values. Lastly, we establish theeffectiveness of using sum as the aggregation function tocombine trust values of a peer.