{"title":"Techniques Used in String Matching for Network Security","authors":"Jamuna Bhandari","volume":89,"journal":"International Journal of Computer and Information Engineering","pagesStart":879,"pagesEnd":883,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/9998719","abstract":"
String matching also known as pattern matching is
\r\none of primary concept for network security. In this area the
\r\neffectiveness and efficiency of string matching algorithms is
\r\nimportant for applications in network security such as network
\r\nintrusion detection, virus detection, signature matching and web
\r\ncontent filtering system. This paper presents brief review on some of
\r\nstring matching techniques used for network security.<\/p>\r\n","references":"[1] G. O. Young, \"Synthetic structure of industrial plastics (Book style with\r\npaper title and editor),\u201d in Plastics, 2nd ed. vol. 3, J. Peters, Ed. New\r\nYork: McGraw-Hill, 1964, pp. 15\u201364.\r\n[2] Young H. Cho and William H. Mangione-Smith. A Pattern Matching\r\nCo-processor for Network Security. Anaheim, California, USA. 2005\r\nACM 1-59593-058-2\/05\/0006, 2005\r\n[3] Robert Giegerich, Frank Hischk. A General Technique to Improve Filter\r\nalgorithms for Approximate String Matching. Fourth South American\r\nWorkshop on String, 1997\r\n[4] Le Zhang, Jingbo Zhu, Tianshun Yao. An Evaluation of Statistical Spam\r\nFiltering Techniques. ACM Transactions on Asian Language\r\nInformation Processing, Vol. 3, No. 4, , Pages 243-269, 2004\r\n[5] Ernest Romanofski. A Comparison of Packet Filtering Vs Application\r\nLevel Fire wall Technology. Global Information Assurance Certification\r\nPaper SANS institute, 2002\r\n[6] Kyi Lin LinKyaw. Hybrid Honeypot System for Network Security.\r\nWorld Academy of Science, Engineering and Technology, 2008\r\n[7] Honeypot Design for Intrusion Detection, American U. of Beirut, 2004\r\n[8] Jean-Pierre van Riel, Barry Irwin. InetVis, a Visual Tool for Network\r\nTelescope Traffic Analysis. AFRIGRAPH 2006, Cape Town, South\r\nAfrica, ACM 1-59593-288-7\/06\/0001, 2006\r\n[9] David Moore et al. Network Telescopes: Technical Report support for\r\nthis work is provided by NSF Trusted Computing Grant CCR-0311690,\r\nCisco Systems University Research Program, DARPA National Institute\r\nof Standards Grant 60NANB1D0118, and a generous gift from AT&T,\r\n2004\r\n[10] Haoyu Song, John W. Lockwood. Multi-pattern Signature Matching for\r\nHardware Network Intrusion Detection Systems. 0-7803-9415-1\/05.\r\nIEEE, 2005\r\n[11] R. Smith, S.Jha \u2018XFA: Faster Signature Matching with Extended\r\nAutomata\u2019 IEEE Symposium on Security and Privacy (Oakland), May\r\n2008\r\n[12] A. Aho and M. J. Corasick. Efficient string matching: An aid to\r\nbibliographic search. Communications of the ACM, 1975\r\n[13] U. Manber and S. Wu, \" A fast algorithm for multi-pattern searching, \u201din\r\nT ech.Report TR-94-17, CS Dept., University of Arizona, 1994\r\n[14] HyunJin Kim \u2018A Memory-Efficient Bit Split Parallel String Matching\r\nUsing Pattern Dividing for Intrusion Detection Systems\u2019 IEEE, vol. 13,\r\nno. 12, 2009\r\n[15] Prasad. R, Agarwal. S, \u2018A new parameterized string matching algorithm\r\nby combining bit-parallelism and suffix automata\u2019 IEEE International\r\nConference on Computer and Information Technology, 2008\r\n[16] Kun Huang, Dafang Zhang \u2018A Byte-Filtered String Matching Algorithm\r\nfor Fast Deep Packet Inspection\u2019 IEEE 9TH Young Computer Scientists,\r\n2008\r\n[17] Tian Song, Wei Zhang, Dongsheng Wang, YiboXue. A Memory\r\nEfficient Multiple Pattern Matching Architecture for Network Security.\r\nThis work is supported by National Natural Science Foundation of\r\nChina (No.60673145). Processing, V alparaiso, Chile,1997\r\n[18] Jiong Zhang and Mohammad Zulkernine. A Hybrid Network Intrusion\r\nDetection Technique Using Random Forests. First International\r\nConference on Availability, Reliability and Security (ARES\u201906) 0-7695-\r\n2567- IEEE, 2006\r\n[19] Tian Song, YiboXue and Dongsheng Wang, \u2018An algorithm of largescale\r\napproximate multiple string matching for network security\u2019, 1-4\r\n244-0463-0\/06\/IEEE, 2006\r\n[20] R. Sidhu and V. K. Prasanna. Fast regualr expression matching using\r\nfpgas. In FCCM, 2001\r\n[21] J. Moscola, J. Lockwood, R. P. Loui, and M. Pachos. Implementation of\r\na content-scanning module for an Internet firewall. In FCCM, 2003\r\n[22] X Tian Song, Wei Zhang et al, A Memory Efficient Multiple Pattern\r\nMatching Architecture for Network Security, This work is supported by\r\nNational Natural Science Foundation of China (No.60673145)","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 89, 2014"}