Attacks and Counter Measures in BST Overlay Structure of Peer-To-Peer System
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32799
Attacks and Counter Measures in BST Overlay Structure of Peer-To-Peer System

Authors: Guruprasad Khataniar, Hitesh Tahbildar, Prakriti Prava Das

Abstract:

There are various overlay structures that provide efficient and scalable solutions for point and range query in a peer-topeer network. Overlay structure based on m-Binary Search Tree (BST) is one such popular technique. It deals with the division of the tree into different key intervals and then assigning the key intervals to a BST. The popularity of the BST makes this overlay structure vulnerable to different kinds of attacks. Here we present four such possible attacks namely index poisoning attack, eclipse attack, pollution attack and syn flooding attack. The functionality of BST is affected by these attacks. We also provide different security techniques that can be applied against these attacks.

Keywords: BST, eclipse attack, index poisoning attack, pollution attack, syn flooding attack.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1081317

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1581

References:


[1] G. Khataniar and D. Goswami, SHP: A Hierarchical Protocol to improve Performance of Peer to Peer Systems, International Journal of Peer to Peer Networks (IJP2P) Vol.3, No5 pages 1-21, 2012.
[2] Steve Crocker, RFC-1 Host Software, http://www.faqs.org/ftp/rfc/rfc1.txt, 1969.
[3] I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, Freenet: A distributed anonymous information storage and retrieval system, In Lecture Notes in Computer Science, pages 46-66, 2000.
[4] J. F. Buford, H. Yu, and E. K. Lua, P2P Networking and Applications, Morgan Kaufmann, 2009.
[5] M. Ripeanu, Peer-to-peer architecture case study: Gnutella network, In Proceedings of the IEEE 1st International Conference on Peer-to-Peer Computing, pages 99-100, Linkoping, Sweden, Aug 2001.
[6] Jian Liang, Naoum Naoumov, and Keith W. Ross, The Index Poisoning Attack in P2P File Sharing Systems, In IEEE Conference on Computer Communication, Barcelona, Spain, 2006.
[7] B. K. Shrivastava, G. Khataniar and D. Goswami, Binary Search Tree: An Efficient Overlay Structure to Support Range Query, 27th International Conference on Distributed Computing Systems Workshops, 2007.
[8] S. Saroiu , K. P. Gummadi, J. D. Richard, S. D. Gribble, and H. M. Levy, An Analysis of Internet Content Delivery Systems, ACM Operating System Review, Vol. 36, pp. 315- 327, 2002.
[9] L. Zhou, L. Zhang, F. McSherry, N. Immorlica, M. Costa, and S. Chien, A First Look at Peerto-Peer Worms: Threats and Defenses, 4th International Workshop on Peer-To-Peer Systems (IPTPS'05), Ithaca, NY, 2005.
[10] N. Naoumov and K. W. Ross, Exploiting P2p Systems for DDoS Attacks, International Workshop on Peer-to-Peer Information Management (keynote address), Hong Kong, 2006.
[11] Lin Wang, Attacks Against Peer-to-peer Networks and Countermeasures, Helsinki University of Technology, 2006.
[12] Dan S. Wallach, A Survey of Peer-to-Peer Security Issuues Rice University, USA.
[13] Sylvia Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A Scalable Content- Addressable Network, in Proceedings of ACM SIGCOMM 2001.
[14] Ion Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-topeer lookup service for internet applications, in Proceedings of SIGCOMM 2001.
[15] Antony Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems, in IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp.329-350, November 2001.
[16] Ben Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, Tapestry: A Resilient Global-Scape Overlay for Service Deployment, IEEE Journal on Selected Areas in Communications, vol. 22, 2004.
[17] Manish Parashar,Manish Agarwal,Steele Arbeeny,Viraj Bhat,Rangini Chowdhury , Evaluating Security Mechanisms in Peer-to-Peer Applications, Piscataway, USA.
[18] G. Khataniar and D. Goswami, Avoidance of churn rate through temporal centralization in Chord, Peer-to-Peer Networking and Applications, Volume 4, Issue 3, pp 251-258, 2011.
[19] H. Rowaihy, W. Enck, P. McDaniel, and T. La Porta, Limiting Sybil attacks in structured P2P networks, in INFOCOM IEEE, pp. 2596 - 2600, 2007.
[20] Dhungel P, Hei X, Ross KW, Saxena N, The pollution attack in P2P live video streaming: measurement results and defences, In Proc of the workshop on peer-to-peer streaming and IP-TV (P2P-TV-07). ACM, New York, pp. 323-328, 2007.
[21] J. Liang, R. Kumar, Y. Xi and K. Ross, Pollution in P2P File Sharing Systems, In Proc. of INFOCOM-05, 2005.