{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T11:13:00Z","timestamp":1773313980375,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319255118","type":"print"},{"value":"9783319255125","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25512-5_4","type":"book-chapter","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T21:23:36Z","timestamp":1443734616000},"page":"39-52","source":"Crossref","is-referenced-by-count":9,"title":["How Cuckoo Filter Can Improve Existing Approximate Matching Techniques"],"prefix":"10.1007","author":[{"given":"Vikas","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Breitinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Baier, H., Breitinger, F.: Security aspects of piecewise hashing in computer forensics. In: IT Security Incident Management & IT Forensics (IMF), pp. 21\u201336, May 2011","DOI":"10.1109\/IMF.2011.16"},{"issue":"7","key":"4_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11841036_61","volume-title":"Algorithms \u2013 ESA 2006","author":"F Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 684\u2013695. Springer, Heidelberg (2006)"},{"issue":"2","key":"4_CR4","first-page":"23","volume":"9","author":"F Breitinger","year":"2014","unstructured":"Breitinger, F., Baggili, I.: File detection on network traffic using approximate matching. J. Digit. Forensics Secur. Law (JDFSL) 9(2), 23\u201336 (2014)","journal-title":"J. Digit. Forensics Secur. Law (JDFSL)"},{"key":"4_CR5","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-39891-9_11","volume-title":"Digital Forensics and Cyber Crime","author":"F Breitinger","year":"2013","unstructured":"Breitinger, F., Baier, H.: Similarity preserving hashing: eligible properties and a new algorithm MRSH-v2. In: Rogers, M., Seigfried-Spellar, K.C. (eds.) ICDF2C 2012. LNICST, vol. 114, pp. 167\u2013182. Springer, Heidelberg (2013)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"S1","DOI":"10.1016\/j.diin.2014.03.001","volume":"11","author":"F Breitinger","year":"2014","unstructured":"Breitinger, F., Baier, H., White, D.: On the database lookup problem of approximate matching. Digital Invest. 11, S1\u2013S9 (2014)","journal-title":"Digital Invest."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Breitinger, F., Guttman, B., McCarrin, M., Roussev, V., White, D.: Approximate matching: Definition and terminology. Special publication 800\u2013168. National Institute of Standards and Technologies, May 2014","DOI":"10.6028\/NIST.SP.800-168"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"S50","DOI":"10.1016\/j.diin.2013.06.006","volume":"10","author":"F Breitinger","year":"2013","unstructured":"Breitinger, F., Stivaktakis, G., Baier, H.: Frash: a framework to test algorithms of similarity hashing. Digit. Investig. 10, S50\u2013S58 (2013)","journal-title":"Digit. Investig."},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2004)","journal-title":"Internet Math."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Networking (TON) 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Networking (TON)"},{"key":"4_CR12","unstructured":"Gallagher, P., Director, A.: Secure Hash Standard (SHS). Technical report, National Institute of Standards and Technologies, Federal Information Processing Standards Publication 180\u20131 (1995)"},{"key":"4_CR13","unstructured":"Gupta, V.: File detection in network traffic using approximate matching. Master\u2019s thesis, Technical University of Denmark, Copenhagen, Denmark (2013)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.diin.2006.06.015","volume":"3","author":"J Kornblum","year":"2006","unstructured":"Kornblum, J.: Identifying almost identical files using context triggered piecewise hashing. Digital Invest. 3, 91\u201397 (2006)","journal-title":"Digital Invest."},{"key":"4_CR15","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography, vol. 5. CRC Press, August 2001"},{"key":"4_CR16","unstructured":"Landon Curt Noll. Fnv hash (1994\u20132012). \n                    http:\/\/www.isthe.com\/chongo\/tech\/comp\/fnv\/index.html"},{"key":"4_CR17","unstructured":"Pagh, A., Pagh, R., Rao, S.S.: An optimal bloom filter replacement. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 823\u2013829. Society for Industrial and Applied Mathematics (2005)"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-72845-0_9","volume-title":"Experimental Algorithms","author":"F Putze","year":"2007","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash- and space-efficient bloom filters. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 108\u2013121. Springer, Heidelberg (2007)"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1049\/iet-bmt.2013.0049","volume":"3","author":"C Rathgeb","year":"2014","unstructured":"Rathgeb, C., Breitinger, F., Busch, C., Baier, H.: On application of bloom filters to iris biometrics. Biometrics, IET 3(4), 207\u2013218 (2014)","journal-title":"Biometrics, IET"},{"key":"4_CR21","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-15506-2_15","volume-title":"Advances in Digital Forensics VI","author":"V Roussev","year":"2010","unstructured":"Roussev, V.: Data fingerprinting with similarity digests. In: Chow, K.-P., Shenoi, S. (eds.) Advances in Digital Forensics VI. IFIP Advances in Information and Communication Technology, vol. 337, pp. 207\u2013226. Springer, Heidelberg (2010)"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.diin.2011.05.005","volume":"8","author":"V Roussev","year":"2011","unstructured":"Roussev, V.: An evaluation of forensic similarity hashes. Digital Invest. 8, 34\u201341 (2011)","journal-title":"Digital Invest."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Digital Forensics and Cyber Crime"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25512-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:17:02Z","timestamp":1559272622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25512-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319255118","9783319255125"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25512-5_4","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}