{"id":"https://openalex.org/W2108962885","doi":"https://doi.org/10.1109/sp.2008.14","title":"XFA: Faster Signature Matching with Extended Automata","display_name":"XFA: Faster Signature Matching with Extended Automata","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2108962885","doi":"https://doi.org/10.1109/sp.2008.14","mag":"2108962885"},"language":"en","primary_location":{"id":"doi:10.1109/sp.2008.14","doi":"https://doi.org/10.1109/sp.2008.14","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sp.2008.14","pdf_url":null,"source":{"id":"https://openalex.org/S4210233669","display_name":"IEEE Symposium on Security and Privacy (S&P)","issn_l":"1081-6011","issn":["1081-6011","2375-1207"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Symposium on Security and Privacy (sp 2008)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013775314","display_name":"Randy Smith","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Randy Smith","raw_affiliation_strings":["University of Wisconsin, Madison, USA","University of Wisconsin, Madison Madison, WI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin, Madison Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088080906","display_name":"Cristian Estan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cristian Estan","raw_affiliation_strings":["University of Wisconsin, Madison, USA","University of Wisconsin, Madison Madison, WI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin, Madison Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088826068","display_name":"Somesh Jha","orcid":"https://orcid.org/0000-0001-5877-0436","observed_orcids":["https://orcid.org/0000-0001-5877-0436"]},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Somesh Jha","raw_affiliation_strings":["University of Wisconsin, Madison, USA","University of Wisconsin, Madison Madison, WI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin, Madison Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":9.7744,"has_fulltext":false,"cited_by_count":172,"citation_normalized_percentile":{"value":0.98994574,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"187","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.006300000008195639,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.003000000026077032,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/extended-finite-automata","display_name":"extended finite automata","score":0.9819999933242798},{"id":"https://openalex.org/keywords/signature-matching","display_name":"signature matching","score":0.9399999976158142},{"id":"https://openalex.org/keywords/network-intrusion-detection-systems","display_name":"network intrusion detection systems","score":0.8870000243186951},{"id":"https://openalex.org/keywords/deterministic-finite-automata","display_name":"deterministic finite automata","score":0.8769999742507935},{"id":"https://openalex.org/keywords/memory-efficiency","display_name":"memory efficiency","score":0.5400000214576721},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.7059999704360962}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7808085680007935},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7179905772209167},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6697250008583069},{"id":"https://openalex.org/C2779696439","wikidata":"https://www.wikidata.org/wiki/Q7512811","display_name":"Signature (topology)","level":2,"score":0.6041457653045654},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.6000595092773438},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5907860994338989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5846341252326965},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.537956714630127},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5251345634460449},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.49136295914649963},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.486112117767334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3719483017921448},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.33677059412002563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1782616376876831},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09800729155540466},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sp.2008.14","doi":"https://doi.org/10.1109/sp.2008.14","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sp.2008.14","pdf_url":null,"source":{"id":"https://openalex.org/S4210233669","display_name":"IEEE Symposium on Security and Privacy (S&P)","issn_l":"1081-6011","issn":["1081-6011","2375-1207"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Symposium on Security and Privacy (sp 2008)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306192","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08"},{"id":"https://openalex.org/F4320307791","display_name":"Cisco Systems","ror":"https://ror.org/03yt1ez60"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1483438220","https://openalex.org/W1490025813","https://openalex.org/W1507645144","https://openalex.org/W1516506771","https://openalex.org/W1542723081","https://openalex.org/W1549671385","https://openalex.org/W1553177637","https://openalex.org/W1621186777","https://openalex.org/W1674877186","https://openalex.org/W1707172707","https://openalex.org/W1891233321","https://openalex.org/W1911613893","https://openalex.org/W1960511147","https://openalex.org/W1971905869","https://openalex.org/W2003648673","https://openalex.org/W2006508099","https://openalex.org/W2030102079","https://openalex.org/W2072607050","https://openalex.org/W2086553822","https://openalex.org/W2095646789","https://openalex.org/W2096474000","https://openalex.org/W2099964107","https://openalex.org/W2100583963","https://openalex.org/W2106062486","https://openalex.org/W2126059122","https://openalex.org/W2134826720","https://openalex.org/W2147340401","https://openalex.org/W2155300758","https://openalex.org/W2163762767","https://openalex.org/W2168844087","https://openalex.org/W2911583164","https://openalex.org/W4247093768","https://openalex.org/W4253563042"],"related_works":["https://openalex.org/W1503601067","https://openalex.org/W1511341314","https://openalex.org/W7100152002","https://openalex.org/W6977759118","https://openalex.org/W7099853846","https://openalex.org/W7096188618","https://openalex.org/W2153244370","https://openalex.org/W2153122359","https://openalex.org/W2014142432","https://openalex.org/W2913020320"],"abstract_inverted_index":{"Automata-based":[0],"representations":[1],"and":[2,15,62,140,167],"related":[3],"algorithms":[4],"have":[5,150,161],"been":[6],"applied":[7],"to":[8,20,38,64,112,165,171],"address":[9],"several":[10,98],"problems":[11],"in":[12,91,105,117],"information":[13],"security,":[14],"often":[16],"the":[17,123],"automata":[18,30,34,53,88,110],"had":[19],"be":[21],"augmented":[22],"with":[23,36,58],"additional":[24],"information.":[25],"For":[26,173],"example,":[27],"extended":[28,51],"finite-state":[29,33,87,109],"(EFSA)":[31],"augment":[32,56],"(FSA)":[35],"variables":[37],"track":[39],"dependencies":[40],"between":[41],"arguments":[42],"of":[43,100,125,157],"system":[44],"calls.":[45],"In":[46,132,146],"this":[47,66],"paper,":[48],"we":[49,149],"introduce":[50],"finite":[52,59],"(XFAs)":[54],"which":[55],"FSAs":[57],"scratch":[60],"memory":[61,181],"instructions":[63],"manipulate":[65],"memory.":[67],"Our":[68],"primary":[69],"motivation":[70],"for":[71,97,129,153],"introducing":[72],"XFAs":[73,160,177],"is":[74],"signature":[75,94,130],"matching":[76,95,191],"inNetwork":[77],"Intrusion":[78],"Detection":[79],"Systems":[80],"(NIDS).":[81],"Representing":[82],"NIDS":[83,114,158],"signatures":[84,101,115,159],"as":[85],"deterministic":[86],"(DFAs)":[89],"results":[90,116],"very":[92],"fast":[93],"but":[96,121,138,144],"classes":[99],"DFAs":[102,135,166],"can":[103],"blowup":[104],"space.":[106],"Using":[107],"nondeterministic":[108],"(NFA)":[111],"represent":[113],"a":[118,154,183],"succinct":[119],"representation":[120],"at":[122],"expense":[124],"higher":[126,190],"time":[127,162],"complexity":[128,163,169],"matching.":[131],"other":[133],"words,":[134],"are":[136,142],"time-efficient":[137],"space-inefficient,":[139],"NFAs":[141],"space-efficient":[143],"time-inefficient.":[145],"our":[147,174],"experiments":[148],"noticed":[151],"that":[152],"large":[155],"class":[156],"similar":[164,170],"space":[168],"NFAs.":[172],"test":[175],"set,":[176],"use":[178],"10":[179],"timesless":[180],"than":[182],"DFA-based":[184],"solution,":[185],"yet":[186],"achieve":[187],"20":[188],"times":[189],"speeds.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":25}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}