Personalizing EigenTrust in the face of Communities and Centrality Attack

被引:10
作者
Chiluka, Nitin [1 ]
Andrade, Nazareno [2 ]
Gkorou, Dimitra [1 ]
Pouwelse, Johan [1 ]
机构
[1] Delft Univ Technol, NL-2600 AA Delft, Netherlands
[2] Univ Fed Paraiba, Campinas, Paraiba, Brazil
来源
2012 IEEE 26TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA) | 2012年
关键词
D O I
10.1109/AINA.2012.48
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
EigenTrust (ET) is a renowned algorithm for reputation management in adversarial P2P systems. It incorporates the opinions of all peers in the network to compute a global trust score for each peer based on its past behavior, and relies on a set of pre-trusted nodes to guarantee that malicious nodes cannot subvert the system. In this paper, we show that ET is vulnerable to community structure and a novel targeted attack based on eigenvector centrality, since ET ranks nodes close to the pre-trusted ones higher than those further away. To address these shortcomings, we propose Personalized EigenTrust (PET) which (i) enables each user to choose her trusted peers from the social network of peers, thereby eliminating the need of pre-trusted nodes and making the system autonomous, (ii) is effective in networks operating under various transaction models based on distributions such as random, community-like and power-law, and (iii) is robust to many types of attacks including the targeted one based on eigenvector centrality. Our simulation results reveal that PET outperforms ET under diverse transaction models and attack strategies.
引用
收藏
页码:503 / 510
页数:8
相关论文
共 22 条
[1]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[2]  
Boratti S. P., 2006, SOCIAL NETWORKS
[3]  
Chawathe Y., SIGCOMM 03
[4]  
Chirita P. A., ISWC 04
[5]  
Choi D., ETRI 10
[6]  
Danezis G., NDSS 09
[7]  
Douceur J. R., IPTPS 01
[8]  
Fogarty J., GI 05
[9]  
Gyongyi Z., VLDB 04
[10]  
Jansen R., 2008, TECHNICAL REPORT