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 条
  • [1] Poisonedwater: an adaptive approach to reducing the reputation ranking error in P2P networks
    Wang, Yufeng
    Nakao, Akihiro
    2009 FIRST INTERNATIONAL CONFERENCE ON FUTURE INFORMATION NETWORKS, 2009, : 263 - +
  • [2] Doubleface: Robust Reputation Ranking Based on Link Analysis in P2P Networks
    Wang, Yufeng
    Nakao, Akihiro
    Vasilakos, Athanasios V.
    CYBERNETICS AND SYSTEMS, 2010, 41 (02) : 167 - 189
  • [3] Reputation based approach for improved fairness and robustness in P2P protocols
    Francis N. Nwebonyi
    Rolando Martins
    Manuel E. Correia
    Peer-to-Peer Networking and Applications, 2019, 12 : 951 - 968
  • [4] Reputation based approach for improved fairness and robustness in P2P protocols
    Nwebonyi, Francis N.
    Martins, Rolando
    Correia, Manuel E.
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2019, 12 (04) : 951 - 968
  • [5] A Reputation-Based Approach for Countering Vulnerabilities in P2P Networks
    Chen, Jianguo
    Lu, Huijuan
    Bruda, Stefan D.
    2010 2ND INTERNATIONAL CONFERENCE ON E-BUSINESS AND INFORMATION SYSTEM SECURITY (EBISS 2010), 2010, : 263 - 266
  • [6] An independent reputation system for P2P networks
    Tayabovorn, Chaiyasit
    Maneewongvatana, Songrit
    ICEIS 2007: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS: SOFTWARE AGENTS AND INTERNET COMPUTING, 2007, : 249 - 252
  • [7] Hierarchical reputation model for P2P networks
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    Dianzi Yu Xinxi Xuebao, 2007, 11 (2560-2563): : 2560 - 2563
  • [8] An effective calculation of reputation in P2P networks
    Prasad, R.V.V.S.V.
    Srinivas, Vegi
    Kumari, V. Valli
    Raju, K.V.S.V.N.
    Journal of Networks, 2009, 4 (05) : 332 - 342
  • [9] Propagation Model of Reputation in P2P Networks
    Sun, Hua
    Li, Li
    Yang, Wenzhong
    Qian, Yurong
    COMMUNICATIONS AND INFORMATION PROCESSING, PT 1, 2012, 288 : 368 - +
  • [10] HopRec: Hop-Based Recommendation Ability Enhanced Reputation Ranking in P2P Networks
    Wang, Yufeng
    Nakao, Akihiro
    Ma, Jianhua
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (03) : 438 - 447