Operators for propagating trust and their evaluation in social networks
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
The effect of malicious peers in a gossip-based reputation system
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Managing Reputation in Contract-Based Distributed Systems
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
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
A probabilistic reputation model based on transaction ratings
Information Sciences: an International Journal
Cardinality estimation and dynamic length adaptation for Bloom filters
Distributed and Parallel Databases
A formal credit-based incentive model for sharing computer resources
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
A mechanism that provides incentives for truthful feedback in peer-to-peer systems
Electronic Commerce Research
An anti-collusion trust model in P2P networks
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
Leveraging Network Properties for Trust Evaluation in Multi-agent Systems
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Context-sensitive trust computing in distributed environments
Knowledge-Based Systems
VOMES: a virtual organisation membership evaluation system
International Journal of Networking and Virtual Organisations
A distributed reputation and trust management scheme for mobile peer-to-peer networks
Computer Communications
Decentralisation of scorefinder: a framework for credibility management on user-generated contents
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
METrust: A mutual evaluation-based trust model for P2P networks
International Journal of Automation and Computing
An incentive mechanism to reinforce truthful reports in reputation systems
Journal of Network and Computer Applications
Trust assessment: a personalized, distributed, and secure approach
Concurrency and Computation: Practice & Experience
To reach consensus using uninorm aggregation operator: A gossip-based protocol
International Journal of Intelligent Systems
Journal of Computer and System Sciences
From credit and risk to trust: towards a credit flow based trust model for social networks
Proceedings of the 17th ACM international conference on Supporting group work
COINS: COalitions and INcentiveS for effective Peer-to-Peer downloads
Journal of Network and Computer Applications
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
VectorTrust: trust vector aggregation scheme for trust management in peer-to-peer networks
The Journal of Supercomputing
Users' attachment in trust networks: reputation vs. effort
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
Abstract In peer-to-peer (P2P) networks, reputation aggregation and ranking are the most time-consuming and space-demanding operations. This paper proposes a new gossip protocol for fast score aggregation. We developed a Bloom filter architecture for efficient score ranking. These techniques do not require any secure hashing or fast lookup mechanism, thus are applicable to both unstructured and structured P2P networks. We report the design principles and performance results of a simulated GossipTrust reputation system. Randomized gossiping with effective use of power nodes enables light-weight aggregation and fast dissemination of global scores in O(log2 n) time steps, where n is the P2P network size. The Gossip-based protocol is designed to tolerate dynamic peer joining and departure, as well as to avoid possible peer collusions. The scheme has a considerably low gossiping message overhead, i.e. O(nlog2 n) messages for n nodes. Bloom filters demand at most 512 KB memory per node for a 10,000-node network. We evaluate the performance of GossipTrust with distributed P2P file-sharing and parameter-sweeping applications. The simulation results demonstrate that GossipTrust has small aggregation time, low memory demand, and high ranking accuracy. These results suggest promising advantages of using the GossipTrust system for trusted P2P applications.