Skip to main content
SpringerLink
Log in

Protecting against malicious and selective forwarding attacks for P2P search & retrieval system

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

With recent advances in networking technology, emerging networks continue to play an increasing role in the lives of most users. The Internet search and retrieval system is so powerful that it helps us to share information and perspectives from across the world. However, the threat of censorship exists on some centralized search engines, since all of their information is currently controlled by these sites administrators. The restriction and control of information are pervasive enough within governments and organizations to censor or intrude on even the most free and uncontrolled communication media. For this reason, the Peer-to-Peer (P2P) search and retrieval system is designed to resist censorship over the network. Nevertheless, its decentralized nature makes it very difficult to infer information that cannot be measured directly, such as the proportion of subverted and selfish nodes. Moreover, the situation is even more challenging when the network becomes extremely large. Hence, I propose a dynamic adaptive algorithm that can: 1) tackle the censorship and security issues; 2) determine the proportion of subverted and selfish nodes; 3) defend against malicious and selective forwarding attacks by appropriately adjusting the number of requests to ensure high match probability; 4) guarantee robustness and scalability even with different random networks and varied network sizes. In several experiments, I demonstrate that my algorithm can effectively and accurately estimate these metrics and manage the system, even when the network has a large proportion of malicious nodes, a large proportion of selfish nodes, or a mere partial view of network membership.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Alajmi N, Elleithy K (2015) Multi-layer approach for the detection of selective forwarding attacks. Sensors 15(11):29332–29345

    Article  Google Scholar 

  2. Barabási A, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512

    Article  MathSciNet  MATH  Google Scholar 

  3. Belen R (2009) Detecting disguised missing data. PhD thesis, Middle East Technical University

  4. Bennett I Media censorship in china. http://www.cfr.org/china/media-censorship-china/p11515. Accessed: 2015-02-08

  5. Bianchi S, Felber P, Gradinariu M (2007) Content-based Publish/subscribe using distributed r-trees. In: Proceedings of Euro-Par. Rennes, France, pp 537–548

  6. Brownlee KA, Brownlee KA (1965) Statistical theory and methodology in science and engineering, vol 150. Wiley, New York

  7. Busse M, Haenselmann T (2006) Wolfgang Effelsberg. Energy-efficient forwarding schemes for wireless sensor networks. In: Proceedings of the International Symposium on on World of Wireless, Mobile and Multimedia Networks, p 2006

  8. Chen X, Shen J, Groves T, Wu J (2009) Probability delegation forwarding in delay tolerant networks. In: Computer Communications and Networks, 2009. ICCCN Proceedings of 18th Internatonal Conference on, p 2009

  9. Chomhaill TN, McKelvey N, Curran K, Subaginy N (2015) Internet censorship in China. In: Mehdi K-P (ed) Encyclopedia of Information Science and Technology, pages pp. 1447–1451. hershey, PA: Information Science Reference third edition edition

  10. Chuang YT, Melliar-Smith PM, Moser LE, Michel Lombera I (2016) Maintaining censorship resistance in the iTrust network for publication, search and retrieval. Peer-to-Peer Networking and Applications 9(2):266–283

  11. Chuang YT, Lombera IM, Moser LE, Melliar-Smith PM (2011) Trustworthy distributed search and retrieval over the Internet. In: Proceedings of the International Conference on Internet Computing, pages 169–175. NV, Las Vegas

  12. Clarke I, Sandberg O, Wiley B, Freenet TH (2001) An distributed anonymous information storage and retrieval system. In: Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, pages 46–66, Berkeley, CA

  13. Cohen B (2008) The bittorrent protocol specification

  14. T. Condie, S. D. Kamvar, and H. Garcia-Molina. Adaptive peer-to-peer topologies. Inproceedings of the 4th IEEE International Conference on Peer-to-Peer Computing, pages 53–62 (August 2004) Zurich Switzerland

  15. Stephen E (1990) Deering and David R Cheriton. Multicast routing in datagram internetworks and extended lans. ACM Transactions on Computer Systems (TOCS) 8(2):85–110

    Article  Google Scholar 

  16. Deng H, Sun X, Wang B, Cao Y (2009) Selective forwarding attack detection using watermark in wsns. In: Computing, Communication, Control, and Management, 2009. CCCM ISECS International Colloquium on, vol 3, p 2009

  17. Erd6s Paul, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hungar Acad Sci 5:17–61

  18. Erramilli V, Crovella M, Chaintreau A, Diot C (2008) Delegation forwarding. In: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, pp 251–260

  19. Farley AM (1980) Broadcast time in communication networks. SIAM J Appl Math 39(2):385–390

    Article  MathSciNet  MATH  Google Scholar 

  20. Farley AM (1979) Minimal broadcast networks. Networks 9(4):313–332

    Article  MathSciNet  MATH  Google Scholar 

  21. Feller W (1968) An Introduction to Probability Theory and Its Applications, volume I John Wiley & Sons

  22. Ferreira RA, Ramanathan MK, Awan A, Grama A, Jagannathan S (2005) Search with probabilistic guarantees in unstructured peer-to-peer networks. In: Proceedings of 5th IEEE International Conference on Peer-to-Peer Computing. Konstanz Germany, pp 165–172

  23. Geethu PC, Mohammed AR (2013) Defense mechanism against selective forwarding attack in wireless sensor networks. In: Computing, Communications and Networking Technologies (ICCCNT) Fourth International Conference on, pages 1–4, p 2013

  24. Ghosh AK, Schwartzbard A (1999) A study in using neural networks for anomaly and misuse detection. In: USENIX Security

  25. Goonatilake R, Herath A, Herath S, Herath J (2007) Intrusion detection using the chi-square goodness-of-fit test for information assurance, network, forensics and software security. J Comput Sci Colleges 23(1):255–263

    Google Scholar 

  26. Yu G, He T (2007) Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links. In: Proceedings of the 5th international conference on Embedded networked sensor systems, pages 321–334 ACM

  27. Gunturu R (2015) Survey of sybil attacks in social networks. arXiv:1504.05522

  28. Gupta A, Sahin O, Agrawal D, Meghdoot A, Abbadi E (2004) Content-based publish/subscribe over P2P networks. In: Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware, pages 254–273, Toronto, Canada

  29. Haas ZJ, Halpern JY, Li L (2006) Gossip-based ad hoc routing. IEEE/ACM Transac Netw (ToN) 14 (3):479–491

    Article  Google Scholar 

  30. Hai Tran Hoang, Huh E-N (2008) Detecting selective forwarding attacks in wireless sensor networks using two-hops neighbor knowledge. In: Network Computing and Applications NCA’08. Seventh, IEEE International Symposium on, pages 325–331. IEEE, p 2008

  31. Hales D (2004) From selfish nodes to cooperative networks - Emergent link-based incentives in peer-to-peer networks. In: Proceedings of the Fourth International Conference on Peer-to-Peer Computing, pages 151–158, Bologna, Italy

  32. Heckert A (2006) Chi-square two sample tests, September. http://www.itl.nist.gov/div898/software/dataplot/refman1/auxillar/chi2samp.htm

  33. Hedetniemi SM, Hedetniemi ST, Liestman AL (1988) A survey of gossiping and broadcasting in communication networks. Networks 18(4):319–349

    Article  MathSciNet  MATH  Google Scholar 

  34. Helman P, Bhangoo J (1997) A statistically based system for prioritizing information exploration under uncertainty. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on 27(4):449–466

    Article  Google Scholar 

  35. Isdal T, Piatek M, Krishnamurthy A, Anderson T (2010) Privacy preserving P2P data sharing with OneSwarm. In: Proceedings of the ACM SIGCOMM Conference, pages 111–122, New Delhi, India

  36. Jesi GP, Hales D, Van Steen M (2007) Identifying Malicious peers before A decentralized secure peer sampling service. In: Proceedings of the 1st International Conference on Self-Adaptive and Self-Organizing Systems, pages 237–246, Boston, MA

  37. Karlof C, Wagner D (2003) Secure routing in wireless sensor networks Attacks and countermeasures. Ad Hoc Netw 1(2):293–315

    Article  Google Scholar 

  38. Lazarevic A, Ertoz L, Kumar V, Ozgur A, Srivastava J (2003) A comparative study of anomaly detection schemes in network intrusion detection. In: Proceedings of the Third SIAM International Conference on Data Mining, pages 25–36, San francisco CA

  39. Lee HY, Cho TH (2007) Fuzzy-based reliable data delivery for countering selective forwarding in sensor networks. In: Ubiquitous Intelligence and Computing, pages 535–544. Springer

  40. Lee W, Stolfo SJ, et al. (1998) Data mining approaches for intrusion detection. In: Usenix security

  41. Mathur Avijit, Newe Thomas, Rao Muzaffar (2016) Defence against black hole and selective forwarding attacks for medical wsns in the iot. Sensors 16(1):118

    Article  Google Scholar 

  42. Melliar-Smith PM, Moser LE, Lombera IM, Chuang YT (2012) iTrust: Trustworthy information publication, search and retrieval. In: Proceedings of the 13th International Conference on Distributed Computing and Networking, pages 351–366, Hong Kong, China

  43. Milgram S (1967) The small world problem. Psychology today 2(1):60–67

    Google Scholar 

  44. Mischke J, Stiller B (2004) A methodology for the design of distributed search in P2P middleware. IEEE Netw 18(1):30–37

    Article  Google Scholar 

  45. Morselli R, Bhattacharjee B, Srinivasan A, Marsh MA (2005) Efficient lookup on unstructured topologies. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing, pages 77–86, Las Vegas, NV

  46. Moser LE, Melliar-Smith PM (2013) Probabilistic analysis of message forwarding. In: Proceedings of the IEEE International Conference on Computer Communications and Networks, Nassau, Bahamas

  47. Moser L. E., Melliar-Smith P. M. (2014) Analysis of the match probabilities for the itrust information network with message forwarding. In: Proceedings of the International Conference on Information Networking, Phuket, Thailand, pp 340–345

  48. Press WH, Teukolsky SA, Vetterling WT, Flannery BP (2007) Numerical Recipes in Fortran: The Art of Scientific Computing. Cambridge University Press. Cambridge , United Kingdom

    MATH  Google Scholar 

  49. Ripeanu M (2001) Peer-to-peer architecture case study: Gnutella network. In: Peer-to-Peer Computing, 2001. Proceedings. First International Conference on, pages 99–100. IEEE

  50. Risson J, Moors T (2006) Survey of research towards robust peer-to-peer networks Search methods. Comput Netw: Int J Comput Telecommun Netw 50(17):3485–3521

    Article  MATH  Google Scholar 

  51. Roberts SW (1959) Control chart tests based on geometric moving averages. Technometrics 1(3):239–250

    Article  Google Scholar 

  52. Saeed Y, Lodhi SA, Ahmed K (2013) Obstacle management in vanet using game theory and fuzzy logic control. Int J Commun 4(1):9

    Google Scholar 

  53. Sasson Y, Cavin D, Schiper A (2003) Probabilistic broadcast for flooding in wireless mobile ad hoc networks conference=Wireless Communications and Networking, 2003. WCNC 2003 IEEE, volume 2, pages 1124–1130, p 2003

  54. Terpstra WW, Kangasharju J, Leng C, Buchmann AP (2007) Bubblestorm: REsilient, probabilistic, and exhaustive peer-to-peer search. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, pages 49–60, Kyoto, Japan

  55. Tran DA, Pham C (2010) Enabling content-based publish/subscribe services in cooperative P2P networks. Comput Netw: Int J Comput Telecommun Netw 52(11):1739–1749

    Article  MATH  Google Scholar 

  56. Travers Jeffrey, Milgram Stanley (1969) An experimental study of the small world problem. Sociometry, 425–443

  57. Tsoumakos D, Roussopoulos N (2003) A comparison of peer-to-peer search methods. In: Proceedings of the Sixth International Workshop on the Web and Databases, pages 61–66, San Diego CA

  58. Viinikka J, Debar H (2004) Monitoring IDS background noise using EWMA control charts and alert information. In: Proceedings of the 7th International Symposium on Recent Advances in Intrusion Detection, pages 166–187, French Riviera, France

  59. Wang L, Kangasharju J (2012) Real-world sybil attacks in bittorrent mainline dht. In: Global Communications Conference (GLOBECOM), 2012 IEEE, pages 826–832, IEEE

  60. Watts DJ, Strogatz SH (1998) Collective dynamics of small-worldnetworks. Nature 393(6684):440–442

    Article  Google Scholar 

  61. Wong B, Quasar SG (2008) A probabilistic publish-subscribe system for social networks. In: Proceedings of the 7th International Workshop on Peer-to-Peer Systems, Tampa Bay FL

  62. Xiao B, Bo Y, Chemas CG (2007) Identify suspect nodes in selective forwarding attacks. J Parallel Distrib Comput 67(11):1218–1230

    Article  MATH  Google Scholar 

  63. Xin-Sheng W, Yong-Zhao Z, Shu-Ming X, Liang-Min W (2009) Lightweight defense scheme against selective forwarding attacks in wireless sensor networks. In: Cyber-Enabled Distributed Computing and Knowledge Discovery CyberC’09. International Conference on, pages 226–232, IEEE, p 2009

  64. Ye N, Chen Q (2001) An anomaly detection technique based on a chi-square statistic for detecting intrusions into information systems. Quality and Reliability Eng Int J 17(2):105– 112

    Article  MathSciNet  Google Scholar 

  65. Bo Y, Xiao B (2006) Detecting selective forwarding attacks in wireless sensor networks. In: Parallel and Distributed Processing Symposium IPDPS 2006. 20th International, pages 8–pp, IEEE, p 2006

  66. Zhou B, Shi Q, Merabti M (2006) Intrusion detection in pervasive networks based on a chi-square statistic test. In: Proceedings of the 30th International Computer Software and Applications Conference, pages 203–208, Chicago, IL

Download references

Acknowledgments

This research was supported in part by MOST 103-2410-H-194-064 and MOST 104-2410-H-194-090-MY2 of Ministry of Science and Technology, Taiwan.

Author information

Authors and Affiliations

  1. Department of Information Management, National Chung Cheng University, 168 University Rd., Minhsiung Township, Chia-Yi, 62100, Taiwan

    Yung-Ting Chuang

Authors
  1. Yung-Ting Chuang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yung-Ting Chuang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chuang, YT. Protecting against malicious and selective forwarding attacks for P2P search & retrieval system. Peer-to-Peer Netw. Appl. 10, 1079–1100 (2017). https://doi.org/10.1007/s12083-016-0500-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-016-0500-1

Keywords

Search

Navigation