The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Spreading Activation Models for Trust Propagation
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
Propagation of trust and distrust
Proceedings of the 13th international conference on World Wide Web
Enhancing reputation mechanisms via online social networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Propagation Models for Trust and Distrust in Social Networks
Information Systems Frontiers
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
New metrics for reputation management in P2P networks
AIRWeb '07 Proceedings of the 3rd international workshop on Adversarial information retrieval on the web
Sabotage-tolerance and trust management in desktop grid computing
Future Generation Computer Systems
Walk-Sums and Belief Propagation in Gaussian Graphical Models
The Journal of Machine Learning Research
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
IEEE Transactions on Parallel and Distributed Systems
Fighting Spam on Social Web Sites: A Survey of Approaches and Future Challenges
IEEE Internet Computing
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
Combating web spam with trustrank
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Analysis of ratings on trust inference in open environments
Performance Evaluation
Towards robust trust establishment in web-based social networks with socialtrust
Proceedings of the 17th international conference on World Wide Web
Socialtrust: tamper-resilient trust establishment in online communities
Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries
Proceedings of the APWeb/WAIM 2007 DBMAN, WebETrends, PAIS and ASWAN international workshops on Advances in Web and Network Technologies, and Information Management
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
IEEE Transactions on Information Theory
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Multi-dimensional evidence-based trust management with multi-trusted paths
Future Generation Computer Systems
Future Generation Computer Systems
METrust: A mutual evaluation-based trust model for P2P networks
International Journal of Automation and Computing
Journal of Network and Computer Applications
Behavior-based reputation management in P2P file-sharing networks
Journal of Computer and System Sciences
Future Generation Computer Systems
Preference-based mining of top-K influential nodes in social networks
Future Generation Computer Systems
Hi-index | 0.00 |
It is argued that social-network based (or group-based) trust metric is effective in resisting various attacks, which evaluates groups of assertions ''in tandem'', and generally computes peers' reputation ranks according to peers' social positions in a trust graph. However, unfortunately, most group-based trust metrics are vulnerable to the attack of ''front peers'', which represents malicious colluding peers who always cooperate with others in order to increase their reputation, and then provide misinformation to promote actively malicious peers. In traditional reputation ranking algorithms, like Eigentrust and Powertrust, etc., front peers could pass most of their reputation value to malicious friends, which leads to malicious peers accruing an improperly high reputation ranking. This paper proposes an alternative social-network based reputation ranking algorithm called Poisonedwater, to infer more accurate reputation ranks then existing schemes, when facing front peers attack. Our contributions are twofold: first we design the framework of the Poisonedwater approach including the following three procedures: (1) the propagation of Poisoned Water (PW): through direct transactions or observations, several malicious users are identified, termed as the poisoned seeds, and the PW will iteratively flood from those poisoned seeds along the reverse indegree direction in the trust graph; (2) the determination of adaptive Spreading Factor (SF) from PW level: based on the logistic model, PW level will correspondingly shrink each peer's adaptive SF, which can determine how much percentage of each peer's reputation could be propagated to its neighbors, and can be regarded as indicative of the peer's recommendation ability; (3) the enhanced group-based reputation ranking algorithm with adaptive SF which seamlessly integrates peers' recommendation ability to infer the more accurate reputation ranking for each peer; second, we experimentally analyze the mathematical implication of the Poisonedwater approach, and investigate the effect of various parameters on the performance of Poisonedwater. Simulation results show that, in comparison with Eigentrust and Powertrust, Poisonedwater can significantly reduce the ranking error ratio up to 20%, when the P2P environment is relatively hostile (i.e., there exists a relatively high percentage of malicious peers and front peers).