Techniques Used in String Matching for Network Security

Authors: Jamuna Bhandari

Abstract:

String matching also known as pattern matching is one of primary concept for network security. In this area the effectiveness and efficiency of string matching algorithms is important for applications in network security such as network intrusion detection, virus detection, signature matching and web content filtering system. This paper presents brief review on some of string matching techniques used for network security.

Keywords: Filtering, honeypot, network telescope, pattern, string, signature.

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

References:

[1] G. O. Young, "Synthetic structure of industrial plastics (Book style with paper title and editor),” in Plastics, 2nd ed. vol. 3, J. Peters, Ed. New York: McGraw-Hill, 1964, pp. 15–64.
[2] Young H. Cho and William H. Mangione-Smith. A Pattern Matching Co-processor for Network Security. Anaheim, California, USA. 2005 ACM 1-59593-058-2/05/0006, 2005
[3] Robert Giegerich, Frank Hischk. A General Technique to Improve Filter algorithms for Approximate String Matching. Fourth South American Workshop on String, 1997
[4] Le Zhang, Jingbo Zhu, Tianshun Yao. An Evaluation of Statistical Spam Filtering Techniques. ACM Transactions on Asian Language Information Processing, Vol. 3, No. 4, , Pages 243-269, 2004
[5] Ernest Romanofski. A Comparison of Packet Filtering Vs Application Level Fire wall Technology. Global Information Assurance Certification Paper SANS institute, 2002
[6] Kyi Lin LinKyaw. Hybrid Honeypot System for Network Security. World Academy of Science, Engineering and Technology, 2008
[7] Honeypot Design for Intrusion Detection, American U. of Beirut, 2004
[8] Jean-Pierre van Riel, Barry Irwin. InetVis, a Visual Tool for Network Telescope Traffic Analysis. AFRIGRAPH 2006, Cape Town, South Africa, ACM 1-59593-288-7/06/0001, 2006
[9] David Moore et al. Network Telescopes: Technical Report support for this work is provided by NSF Trusted Computing Grant CCR-0311690, Cisco Systems University Research Program, DARPA National Institute of Standards Grant 60NANB1D0118, and a generous gift from AT&T, 2004
[10] Haoyu Song, John W. Lockwood. Multi-pattern Signature Matching for Hardware Network Intrusion Detection Systems. 0-7803-9415-1/05. IEEE, 2005
[11] R. Smith, S.Jha ‘XFA: Faster Signature Matching with Extended Automata’ IEEE Symposium on Security and Privacy (Oakland), May 2008
[12] A. Aho and M. J. Corasick. Efficient string matching: An aid to bibliographic search. Communications of the ACM, 1975
[13] U. Manber and S. Wu, " A fast algorithm for multi-pattern searching, ”in T ech.Report TR-94-17, CS Dept., University of Arizona, 1994
[14] HyunJin Kim ‘A Memory-Efficient Bit Split Parallel String Matching Using Pattern Dividing for Intrusion Detection Systems’ IEEE, vol. 13, no. 12, 2009
[15] Prasad. R, Agarwal. S, ‘A new parameterized string matching algorithm by combining bit-parallelism and suffix automata’ IEEE International Conference on Computer and Information Technology, 2008
[16] Kun Huang, Dafang Zhang ‘A Byte-Filtered String Matching Algorithm for Fast Deep Packet Inspection’ IEEE 9TH Young Computer Scientists, 2008
[17] Tian Song, Wei Zhang, Dongsheng Wang, YiboXue. A Memory Efficient Multiple Pattern Matching Architecture for Network Security. This work is supported by National Natural Science Foundation of China (No.60673145). Processing, V alparaiso, Chile,1997
[18] Jiong Zhang and Mohammad Zulkernine. A Hybrid Network Intrusion Detection Technique Using Random Forests. First International Conference on Availability, Reliability and Security (ARES’06) 0-7695- 2567- IEEE, 2006
[19] Tian Song, YiboXue and Dongsheng Wang, ‘An algorithm of largescale approximate multiple string matching for network security’, 1-4 244-0463-0/06/IEEE, 2006
[20] R. Sidhu and V. K. Prasanna. Fast regualr expression matching using fpgas. In FCCM, 2001
[21] J. Moscola, J. Lockwood, R. P. Loui, and M. Pachos. Implementation of a content-scanning module for an Internet firewall. In FCCM, 2003
[22] X Tian Song, Wei Zhang et al, A Memory Efficient Multiple Pattern Matching Architecture for Network Security, This work is supported by National Natural Science Foundation of China (No.60673145)