The index poisoning attack in P2P file sharing systems

被引:0
作者
Liang, Jian [1 ]
Naoumov, Naoum [1 ]
Ross, Keith W. [1 ]
机构
[1] Polytech Univ, Dept Comp & Informat Sci, Brooklyn, NY 11201 USA
来源
25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006 | 2006年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
P2P file-sharing systems have indexes, which users search to find locations of desired titles. In the index poisoning attack, the attacker inserts massive numbers of bogus records into the index for a set of targeted titles. As a result, when a user searches for a targeted title, the index returns bogus results, such as bogus file identifiers, bogus IP addresses, or bogus port numbers. In this paper we first show that both structured and unstructured P2P file-sharing systems are highly vulnerable to the index poisoning attack. We then develop a novel and efficient methodology for estimating index poisoning levels and pollution levels in file-sharing systems. The methodology is efficient in that involves neither the downloading nor the analysis of binary content files. We deploy data-harvesting platforms for FastTrack, an unstructured file-sharing system, and Overnet, a DHT-based file-sharing system. Applying our methodology to harvested data, we find that index poisoning is pervasive in both systems. We also outline a distributed blacklisting procedure for countering the index poisoning and pollution attacks.
引用
收藏
页码:1737 / 1748
页数:12
相关论文
共 24 条
  • [1] AGGARWAL V, 2004, P WORKSH ALG PROT EF
  • [2] [Anonymous], FFMPEG Project
  • [3] BHAGWAN R, 2003, 2 INT WORKSH PEER TO
  • [4] *CACHELOGIC RES, TRUE PICT P2P FIL SH
  • [5] CHRISTIN N, 2005, P 6 ACM C EL COMM EC
  • [6] DUMITRIU D, 2005, P ACM SIGMETRICS 200
  • [7] GUHA S, CHARACTERIZATI UNPUB
  • [8] GUMMADI K, 2003, P 19 ACM S OP SYST P
  • [9] Kamvar S. D, EIGENTRUST ALGORITHM
  • [10] LEFESSANT F, CLUSTERING PEER TO P