• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

ELiSyR: Efficient, Lightweight and Sybil-Resilient File Search in P2P Networks

Vol. 4, No. 6, December 22, 2010
10.3837/tiis.2010.12.019, Download Paper (Free):


Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.


Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.

Cite this article

[IEEE Style]
H. S. Kim, E. Jung and H. Y. Yeom, "ELiSyR: Efficient, Lightweight and Sybil-Resilient File Search in P2P Networks," KSII Transactions on Internet and Information Systems, vol. 4, no. 6, pp. 1311-1326, 2010. DOI: 10.3837/tiis.2010.12.019.

[ACM Style]
Hyeong S. Kim, Eunjin(EJ) Jung, and Heon Y. Yeom. 2010. ELiSyR: Efficient, Lightweight and Sybil-Resilient File Search in P2P Networks. KSII Transactions on Internet and Information Systems, 4, 6, (2010), 1311-1326. DOI: 10.3837/tiis.2010.12.019.