{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T02:21:34Z","timestamp":1696040494184},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Network"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1109\/mnet.2009.4804321","type":"journal-article","created":{"date-parts":[[2009,3,24]],"date-time":"2009-03-24T19:23:01Z","timestamp":1237922581000},"page":"30-35","source":"Crossref","is-referenced-by-count":13,"title":["Counting bloom filters for pattern matching and anti-evasion at the wire speed"],"prefix":"10.1109","volume":"23","author":[{"given":"Gianni","family":"Antichi","sequence":"first","affiliation":[]},{"given":"Domenico","family":"Ficara","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Giordano","sequence":"additional","affiliation":[]},{"given":"Gregorio","family":"Procissi","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Vitucci","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","author":"ptacek","year":"1998","journal-title":"Insertion evasion and denial of service Eluding network intrusion detection"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285287"},{"key":"ref10","first-page":"181","article-title":"Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing","author":"song","year":"2005","journal-title":"Proc 2005 Conf Apps Tech Architectures Protocols Comp Commun"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577961"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.1090"},{"key":"ref5","first-page":"9","article-title":"Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics","author":"handley","year":"2001","journal-title":"Proc 10th Conf USENIX Sec Symp"},{"key":"ref12","first-page":"684","article-title":"An Improved Construction for Counting Bloom Filters","author":"bonomi","year":"2006","journal-title":"LNCS 4168 14th Annual Euro Symp Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.27"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159951"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2007.4317817"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.71"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.1268997"}],"container-title":["IEEE Network"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/65\/4804313\/04804321.pdf?arnumber=4804321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:18:47Z","timestamp":1642004327000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4804321\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":12,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/mnet.2009.4804321","relation":{},"ISSN":["0890-8044"],"issn-type":[{"value":"0890-8044","type":"print"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}