KSII Transactions on Internet and Information Systems (TIIS)

  • 제4권6호
  • /
  • Pages.1311-1326
  • /
  • 2010
  • /
  • 1976-7277(pISSN)
  • /
  • 1976-7277(eISSN)
한국인터넷정보학회 (Korean Society for Internet Information)
권호 표지
DOI QR코드

DOI QR Code

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

  • Kim, Hyeong-S. (School of Computer Science and Engineering, Seoul National University) ;
  • Jung, Eun-Jin (Department of Computer Science, University of San Francisco) ;
  • Yeom, Heon-Y. (School of Computer Science and Engineering, Seoul National University)
  • 투고 : 2010.02.05
  • 심사 : 2010.10.27
  • 발행 : 2010.12.23
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. H. Schulze and K. Mochalski. "iPoq Internet Study 2007," http://www.ipoque.com/userfiles/file/ internet_study_2007.pdf, Dec. 2007.
  2. "BitTorrent Acquires $\mu Torrent$," http://www.bittorrent.com/pressreleases/2006/12/06/bittorrent -acquires-%C2%B5torrent, Dec. 2006.
  3. T. Claburn. "Fake mp3 Trojan detected on 27% of PCs," http://www.informationweek.com/story/show.jhtml? ID=207600502, May 2008.
  4. L. Page, S. Brin, R. Motwani and T. Winograd, "The PageRank citation ranking: Bring order to the Web," in Proc. of the 7th International World Wide Web Conf., Apr. 1998.
  5. A. Cheng and E. Friedman, "Sybilproof reputation mechanisms," in SIGCOMM 05 Workshop, Aug. 2005.
  6. M. Oiaga. "eBay Bot Fraud - positive feedback is used as an incentive to attract victims," http://news.softpedia.com/news/eBay-Bot-Fraud-31711.shtml, Aug. 2006.
  7. H. Yu, M. Kaminsky, B. P. Gibbons and A. Flaxman, "SybilGuard: Defending against sybil attacks via social networks," in ACM SIGCOMM, Sept. 2006.
  8. H. Yu, P. Gibbons, M. Kaminsky and F. Xiao, "SybilLimit: A near-optimal social network defense against sybil attacks," in Proc. of the 2008 IEEE Symposium on Security and Privacy, May 2008.
  9. G. Danezis, C. Lesniewski-Laas, F. M. Kaashoek and R. Anderson, "Sybil-resistant DHT routing," in ESORICS, Sept. 2005.
  10. H. Rowaihy, W. Enck, P. McDaniel and L. T. Porta, "Limiting sybil attacks in structured p2p networks," in INFOCOM Mini-Symposium, May 2007.
  11. D. S. Kamvar, T. M. Scholosser and H. Garcia-Molina, "The EigenTrust algorithm for reputation management in P2P networks," in Proc. of the 12th International Conference on World Wide Web, May 2003.
  12. D. S. Kamvar, T. M. Scholosser and H. Garcia-Molina, "The EigenTrust algorithm for reputation management in P2P networks," in Proc. of the 12th International Conference on World Wide Web, May 2003.
  13. N. B. Levine, C. Shields and B. N. Margolin, "A survey of solutions to the sybil attack," Univ. of Massachusetts Amherst, Tech report 2006-052, Oct. 2006.
  14. B. N. Margolin and N. B. Levine, "Informant: detecting sybils using incentives," in Proc. of Financial Cryptography (FC), Feb. 2007.
  15. T. Kohno, A. Broido and K. Claffy, "Remote physical device fingerprinting," in Proc. of IEEE Symposium on Security and Privacy, May 2005.
  16. C. Hota, J. Lindqvist, K. Karvonen, A. Yla-Jaaski and J. C.K. Mohan, "Safeguarding Against Sybil Attacks via Social Networks and Multipath Routing," in Proc. of International Conf. on Networking, Architecture, and Storage, Aug. 2007.
  17. Qinyuan Feng and Yafei Dai, "LIP: A LIfetime and Popularity Based Ranking Approach to Filter out Fake Files in P2P File Sharing Systems," in Proc. of International Workshop on Peer-To-Peer Systems, Feb. 2007.
  18. S. Saroiu, P. K. Gummadi and S. D. Gribble, "A measurement study of peer-to-peer file sharing systems," in Proc. of Multimedia Computing and Networking (MMCN), Jan. 2002.
  19. N. Sarshar, O. P. Boykin and P. V. Roychowdhury, "Percolation search in power law networks: Making unstructured peer-to-peer networks scalable," in Proc. of the 4th International Conf. on Peer-to-Peer Computing (P2P), Aug. 2004.
  20. C. Gkantsidis, M. Mihail and A. Saberi, "Random walks in peer-to-peer networks," in Proc. of Thenty-third Annual Joint Conf. of the INFOCOM, Mar. 2004.
  21. Q. Lv, P. Cao, E. Cohen, K. Li and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in Proc. of International Conf. on Supercomputing, June 2002.
  22. Y. Chawathe, S. Ratnasamy, N. L. B. Lanham and S. Shenker, "Making gnutella-like p2p systems scalable," in Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, Aug. 2003.
  23. C. Gkantsidis, M. Mihail and A. Saberi, "Random walks in peer-to-peer networks: Algorithms and evaluation," Performance Evaluation, vol. 63, no. 3, pp. 241-263, Mar. 2006. https://doi.org/10.1016/j.peva.2005.01.002
  24. D. Tsoumakos and N. Roussopoulos, "Adaptive probabilistic search for peer-to-peer networks," in Proc. of the 3rd International Conf. on Peer-to-Peer Computing (P2P), Sept. 2003.
  25. S. Jin and H. Jiang, "Novel approaches to efficient flooding search in peer-to-peer networks," The International Journal of Computer and Telecommunications Networking, vol. 51, no. 10, pp. 2818-2832, July 2007.
  26. L. Adamic, R. Lukose and B. Huberman, "Search in power-law networks," Physical Review, vol. 64, no. 4, p. 046135, Sept. 2001.
  27. Michalis Faloutsos, Petros Faloutsos and Christos Faloutsos, "On power-law relationships of the Internet topology," in Proc. of ACM SIGCOMM, Aug. 1999.
  28. Lazaros K Gallos, Reuven Cohen, Panos Argyrakis, Armin Bunde and Shlomo Havlin, "Stability and Topology of Scale-Free Networks under Attack and Defense Strategies," Physical Review Letters, vol. 94, no. 18, p. 188701, May 2005. https://doi.org/10.1103/PhysRevLett.94.188701
  29. M. R. Christley, L. G. Pinchbeck, G. R. Bowers, D. Clancy, P. N. French, R. Bennett and J. Turner, "Infection in Social Networks: Using Network Analysis to Identify High-Risk Individuals," American Journal of Epidemiology, vol. 162, no. 10, pp. 1024-1031, Sept. 2005. https://doi.org/10.1093/aje/kwi308
  30. M. Ripeanu, "Peer-to-peer architecture case study: Gnutella network," in Proc. of the 1st International Conf. on Peer-to-Peer Computing (P2P), Aug. 2001.
  31. T. M. Schlosser, E. T. Condie and D. S. KIamvar, "Simulating a file-sharing p2p network," in Porc. of Workshop in Semantics in Peer-to-Peer and Grid computing, Dec. 2002.
  32. A. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, Oct.1999. https://doi.org/10.1126/science.286.5439.509
  33. A. Fast, Jensen D. and N. B. Levine, "Creating social networks to improve peer-to-peer networking," in Proc. of the eleventh International Conf. on Knowledge Discovery in Data Mining (SIGKDD), Aug. 2005.
  34. "OpenNap: Open source napster server," http://opennap.sourceforge.net, September 2001.
  35. A. Iamnitchi, M. Ripeanu and I. Foster, "Small-world file-sharing communities," in Proc. of The 23rd Conf. of the IEEE Communication Society (INFOCOM), Mar. 2004.