{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:29Z","timestamp":1763467949726,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043413"},{"type":"electronic","value":"9783642043420"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04342-0_15","type":"book-chapter","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T23:00:22Z","timestamp":1254178822000},"page":"284-303","source":"Crossref","is-referenced-by-count":29,"title":["Multi-byte Regular Expression Matching with Speculation"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Luchaup","sequence":"first","affiliation":[]},{"given":"Randy","family":"Smith","sequence":"additional","affiliation":[]},{"given":"Cristian","family":"Estan","sequence":"additional","affiliation":[]},{"given":"Somesh","family":"Jha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Corasick, M.: Efficient string matching: An aid to bibliographic search. Communications of the ACM (June 1975)","DOI":"10.1145\/360825.360855"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Alicherry, M., Muthuprasannap, M., Kumar, V.: High speed pattern matching for network IDS\/IPS. In: ICNP (November 2006)","DOI":"10.1109\/ICNP.2006.320212"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Becchi, M., Crowley, P.: An improved algorithm to accelerate regular expression evaluation. In: ANCS 2007 (2007)","DOI":"10.1145\/1323548.1323573"},{"key":"15_CR4","volume-title":"Proceedings of the 2008 ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","author":"M. Becchi","year":"2008","unstructured":"Becchi, M., Crowley, P.: Efficient regular expression evaluation: Theory to practice. In: Proceedings of the 2008 ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS). ACM, New York (2008)"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/1150019.1136500","volume":"34","author":"B. Brodie","year":"2006","unstructured":"Brodie, B., Cytron, R.K., Taylor, D.: A scalable architecture for high-throughput regular-expression pattern matching. SIGARCH Comput. Archit. News\u00a034(2), 191\u2013202 (2006)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Brumley, D., Newsome, J., Song, D., Wang, H., Jha, S.: Towards automatic generation of vulnerability-based signatures. In: IEEE Symposium on Security and Privacy (May 2006)","DOI":"10.1109\/SP.2006.41"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Clark, C.R., Schimmel, D.E.: Scalable pattern matching for high-speed networks. In: IEEE FCCM (April 2004)","DOI":"10.1109\/FCCM.2004.50"},{"issue":"10","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1109\/JSAC.2006.877131","volume":"24","author":"S. Dharmapurikar","year":"2006","unstructured":"Dharmapurikar, S., Lockwood, J.W.: Fast and scalable pattern matching for network intrusion detection systems. IEEE Journal on Selected Areas in Comm.\u00a024(10), 1781\u20131792 (2006)","journal-title":"IEEE Journal on Selected Areas in Comm."},{"issue":"5","key":"15_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1452335.1452339","volume":"38","author":"D. Ficara","year":"2008","unstructured":"Ficara, D., Giordano, S., Procissi, G., Vitucci, F., Antichi, G., Pietro, A.D.: An improved dfa for fast regular expression matching. SIGCOMM Comput. Commun. Rev.\u00a038(5), 29\u201340 (2008)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"15_CR10","unstructured":"Handley, M., Paxson, V., Kreibich, C.: Network intrusion detection: Evasion, traffic normalization, and end-to-end protocol semantics. In: Usenix Security (August 2001)"},{"issue":"12","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1145\/7902.7903","volume":"29","author":"W.D. Hillis","year":"1986","unstructured":"Hillis, W.D., Guy, J., Steele, L.: Data parallel algorithms. Communications of the ACM\u00a029(12), 1170\u20131183 (1986)","journal-title":"Communications of the ACM"},{"key":"15_CR12","unstructured":"Jordan, M.: Dealing with metamorphism. Virus Bulletin Weekly (2002)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kong, S., Smith, R., Estan, C.: Efficient signature matching with multiple alphabet compression tables. In: Securecomm (September 2008)","DOI":"10.1145\/1460877.1460879"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Kruegel, C., Valeur, F., Vigna, G., Kemmerer, R.: Stateful intrusion detection for high-speed networks. In: Proceedings of the IEEE Symposium on Security and Privacy, May 2002, pp. 285\u2013293 (2002)","DOI":"10.1109\/SECPRI.2002.1004378"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, S., Dharmapurikar, S., Yu, F., Crowley, P., Turner, J.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: ACM SIGCOMM (September 2006)","DOI":"10.1145\/1159913.1159952"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1015047.1015055","volume":"3","author":"R. Liu","year":"2004","unstructured":"Liu, R., Huang, N., Chen, C., Kao, C.: A fast string-matching algorithm for network processor-based intrusion detection system. Trans. on Embedded Computing Sys.\u00a03(3), 614\u2013633 (2004)","journal-title":"Trans. on Embedded Computing Sys."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0020-0190(02)00416-7","volume":"85","author":"J. Misra","year":"2003","unstructured":"Misra, J.: Derivation of a parallel string matching algorithm. Information Processing Letters\u00a085, 255\u2013260 (2003)","journal-title":"Information Processing Letters"},{"key":"15_CR18","unstructured":"Paxson, V.: Defending against network IDS evasion. In: Recent Advances in Intrusion Detection, RAID (1999)"},{"key":"15_CR19","unstructured":"Ptacek, T., Newsham, T.: Insertion, evasion and denial of service: Eluding network intrusion detection. Secure Networks, Inc. (January 1998)"},{"key":"15_CR20","unstructured":"Roesch, M.: Snort - lightweight intrusion detection for networks. In: 13th Systems Administration Conference. USENIX (1999)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Shankar, U., Paxson, V.: Active mapping: Resisting nids evasion without altering traffic. In: IEEE Symp. on Security and Privacy (May 2003)","DOI":"10.1109\/SECPRI.2003.1199327"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Smith, R., Estan, C., Jha, S.: Deflating the big bang: Fast and scalable deep packet inspection with extended finite automata. In: SIGCOMM (August 2008)","DOI":"10.1145\/1402958.1402983"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Smith, R., Estan, C., Jha, S.: XFA: Faster signature matching with extended automata. In: IEEE Symposium on Security and Privacy (May 2008)","DOI":"10.1109\/SP.2008.14"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Sommer, R., Paxson, V.: Enhancing byte-level network intrusion detection signatures with context. In: ACM CCS (October 2003)","DOI":"10.1145\/948109.948145"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Sourdis, I., Pnevmatikatos, D.: Fast, large-scale string match for a 10gbps fpga-based network intrusion detection system. In: Int. Conf. on Field Programmable Logic and Applications (September 2003)","DOI":"10.1007\/978-3-540-45234-8_85"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Tan, L., Sherwood, T.: A high throughput string matching architecture for intrusion detection and prevention. In: ISCA (June 2005)","DOI":"10.1145\/1080695.1069981"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Tuck, N., Sherwood, T., Calder, B., Varghese, G.: Deterministic memory-efficient string matching algorithms for intrusion detection. In: IEEE INFOCOM 2004, pp. 333\u2013340 (2004)","DOI":"10.1109\/INFCOM.2004.1354682"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Wang, H.J., Guo, C., Simon, D., Zugenmaier, A.: Shield: Vulnerability-driven network filters for preventing known vulnerability exploits. In: ACM SIGCOMM (August 2004)","DOI":"10.1145\/1015467.1015489"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Weinsberg, Y., Tzur-David, S., Dolev, D., Anker, T.: High performance string matching algorithm for a network intrusion prevention system. In: High Performance Switching and Routing (2006)","DOI":"10.1109\/HPSR.2006.1709697"},{"key":"15_CR30","unstructured":"Yu, F., Katz, R.H., Lakshman, T.: Gigabit rate packet pattern-matching using tcam. In: ICNP, pp. 174\u2013183 (2004)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Intrusion Detection"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04342-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T11:47:51Z","timestamp":1739360871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04342-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043413","9783642043420"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04342-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}