Poisonedwater: An improved approach for accurate reputation ranking in P2P networks

被引:26
|
作者
Wang Yufeng [1 ,2 ]
Nakao, Akihiro [3 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100088, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Nanjing, Peoples R China
[3] Univ Tokyo, Tokyo 1138654, Japan
关键词
Trust and reputation ranking; P2P; Social-network;
D O I
10.1016/j.future.2009.05.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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). (c) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:1317 / 1326
页数:10
相关论文
共 50 条
  • [41] New trust model based on reputation and risk evaluation for P2P networks
    State Key Lab. of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2007, 29 (07): : 1628 - 1632
  • [42] Local reputation for P2P MMOG design
    Liu, Shanshan
    Li, Jinlong
    Wang, Xufa
    EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2007, : 523 - 527
  • [43] Analytical evaluation of P2P reputation systems
    Lagesse, Brent
    INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS, 2012, 9 (1-2) : 82 - 96
  • [44] A Reactive Approach for Detection of Collusion Attacks in P2P Trust and Reputation Systems
    Saini, Nitin Kumar
    Sihag, Vikas Kumar
    Yadav, Ramesh Chand
    SOUVENIR OF THE 2014 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2014, : 312 - 317
  • [45] Neighbourhood maps: decentralized ranking in small-world P2P networks
    Dell'Amico, Matteo
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2008, 20 (06): : 659 - 674
  • [46] Improved Degree Search Algorithms in Unstructured P2P Networks
    Liu, Guole
    Peng, Haipeng
    Li, Lixiang
    Yang, Yixian
    Luo, Qun
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
  • [47] SPTrust: Reputation Aggregation Method Based on Similarity to Reputation Scores of Power Nodes in Unstructured P2P Networks
    Takeda, Sonoko
    Ushikubo, Hiroki
    Shigeno, Hiroshi
    2013 EIGHTH INTERNATIONAL CONFERENCE ON BROADBAND, WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS (BWCCA 2013), 2013, : 265 - 272
  • [48] X2BT trusted reputation system:: A robust mechanism for P2P networks
    Yu, Lan
    Susilo, Willy
    Safavi-Naini, Rei
    CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 2006, 4301 : 364 - +
  • [49] Modeling Reputation Scheme in P2P File-sharing by Stochastic Activity Networks
    Zhang, Peiqing
    Helvik, Bjarne E.
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2009, : 353 - 358
  • [50] Efficient Botnet Detection based on Reputation Model and Content Auditing in P2P Networks
    Kalaivani, K.
    Suguna, C.
    PROCEEDINGS OF 2015 IEEE 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL (ISCO), 2015,