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 条
  • [31] Improved P2P streaming in wireless networks utilizing access point P2P agents
    Lai, Chung-Yi
    Hsu, Chiun-Sheng
    Shang, Tzyh-Jong
    ISM WORKSHOPS 2007: NINTH IEEE INTERNATIONAL SYMPOSIUM ON MULTIMEDIA - WORKSHOPS, PROCEEDINGS, 2007, : 58 - 62
  • [32] Analysis and survey on page ranking algorithms for web and P2P networks
    Qu, HC
    Fu, HG
    Yang, GC
    Proceedings of the 11th Joint International Computer Conference, 2005, : 226 - 229
  • [33] An Adaptive Topology-Based Reputation Model for Unstructured P2P Networks
    Gui, Jinsong
    Deng, Xiaoheng
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 1505 - 1510
  • [34] A Mechanism Based on Reputation in P2P Networks to Counter Malicious Packet Dropping
    PENG Hao1
    2.School of Information Security Engineering
    Wuhan University Journal of Natural Sciences, 2011, 16 (05) : 405 - 408
  • [35] Content access control scheme for P2P networks using a reputation value
    Aburada, Kentaro
    Kita, Yoshihiro
    Park, Mirang
    Okazaki, Naonobu
    2015 IEEE 29TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (IEEE AINA 2015), 2015, : 527 - 533
  • [36] P2P Networks Considering Sybil-proof with the Reputation of Social Link
    Guo Zongyuan
    Madrazo, Carlos
    Koyanag, Keiichi
    ADVANCED RESEARCH IN MATERIAL SCIENCE AND MECHANICAL ENGINEERING, PTS 1 AND 2, 2014, 446-447 : 1596 - +
  • [37] P2P reputation management: Probabilistic estimation vs. social networks
    Despotovic, Z
    Aberer, K
    COMPUTER NETWORKS, 2006, 50 (04) : 485 - 500
  • [38] A Novel Reputation Management Mechanism with Forgiveness in P2P File Sharing Networks
    Li, Mingchu
    Wang, Junlong
    Lu, Kun
    Guo, Cheng
    Tan, Xing
    11TH INTERNATIONAL CONFERENCE ON FUTURE NETWORKS AND COMMUNICATIONS (FNC 2016) / THE 13TH INTERNATIONAL CONFERENCE ON MOBILE SYSTEMS AND PERVASIVE COMPUTING (MOBISPC 2016) / AFFILIATED WORKSHOPS, 2016, 94 : 360 - 365
  • [39] Economic-inspired truthful reputation feedback mechanism in P2P networks
    Wang, Yufeng
    Hori, Yoshiaki
    Sakurai, Kouichi
    11TH IEEE INTERNATIONAL WORKSHOP ON FUTURE TRENDS OF DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2007, : 80 - +
  • [40] A New Reputation Mechanism Based on Referral's Credibility for P2P Networks
    Zhang, Yulian
    Wang, Lihua
    2012 11TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING & SCIENCE (DCABES), 2012, : 153 - 156