{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:47:21Z","timestamp":1762624041075,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930398"},{"type":"electronic","value":"9783319930404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93040-4_42","type":"book-chapter","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T13:29:41Z","timestamp":1529155781000},"page":"530-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Pattern-Mining Based Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Peter","family":"Christen","sequence":"first","affiliation":[]},{"given":"Anushka","family":"Vidanage","sequence":"additional","affiliation":[]},{"given":"Thilina","family":"Ranbaduge","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Schnell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,17]]},"reference":[{"key":"42_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB, Santiago de Chile (1994)"},{"issue":"7","key":"42_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-23633-9_11","volume-title":"Medical Data Privacy Handbook","author":"JH Boyd","year":"2015","unstructured":"Boyd, J.H., Randall, S.M., Ferrante, A.M.: Application of privacy-preserving techniques in operational record linkage centres. In: Gkoulalas-Divanis, A., Loukides, G. (eds.) Medical Data Privacy Handbook, pp. 267\u2013287. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23633-9_11"},{"key":"42_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-319-57454-7_49","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Christen","year":"2017","unstructured":"Christen, P., Schnell, R., Vatsalan, D., Ranbaduge, T.: Efficient cryptanalysis of bloom filters for privacy-preserving record linkage. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10234, pp. 628\u2013640. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_49"},{"issue":"12","key":"42_CR6","first-page":"2956","volume":"26","author":"EA Durham","year":"2014","unstructured":"Durham, E.A., Kantarcioglu, M., Xue, Y., Toth, C., Kuzu, M., Malin, B.: Composite Bloom filters for secure record linkage. IEEE TKDE 26(12), 2956\u20132968 (2014)","journal-title":"IEEE TKDE"},{"issue":"10","key":"42_CR7","first-page":"1347","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using FP-trees. IEEE TKDE 17(10), 1347\u20131362 (2005)","journal-title":"IEEE TKDE"},{"key":"42_CR8","first-page":"209","volume":"11","author":"M Hegland","year":"2005","unstructured":"Hegland, M.: The Apriori algorithm - a tutorial. Math. Comput. Imaging Sci. Inf. Process. 11, 209\u2013262 (2005)","journal-title":"Math. Comput. Imaging Sci. Inf. Process."},{"issue":"2","key":"42_CR9","first-page":"292","volume":"30","author":"D Karapiperis","year":"2017","unstructured":"Karapiperis, D., Gkoulalas-Divanis, A., Verykios, V.S.: FEDERAL: a framework for distance-aware privacy-preserving record linkage. IEEE TKDE 30(2), 292\u2013304 (2017)","journal-title":"IEEE TKDE"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Kroll, M., Steinmetzer, S.: Automated cryptanalysis of bloom filter encryptions of databases with several personal identifiers. In: BIOSTEC, Lisbon (2015)","DOI":"10.5220\/0005176000050013"},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-22263-4_13","volume-title":"Privacy Enhancing Technologies","author":"M Kuzu","year":"2011","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E., Malin, B.: A constraint satisfaction cryptanalysis of bloom filters in private record linkage. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 226\u2013245. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22263-4_13"},{"issue":"2","key":"42_CR12","first-page":"285","volume":"20","author":"M Kuzu","year":"2013","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E., Toth, C., Malin, B.: A practical approach to achieve private medical record linkage in light of public resources. JAMIA 20(2), 285\u2013292 (2013)","journal-title":"JAMIA"},{"issue":"4","key":"42_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1504\/IJBDI.2017.086956","volume":"4","author":"W Mitchell","year":"2017","unstructured":"Mitchell, W., Dewri, R., Thurimella, R., Roschke, M.: A graph traversal attack on Bloom filter-based medical data aggregation. IJBDI 4(4), 217\u2013226 (2017)","journal-title":"IJBDI"},{"key":"42_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"42_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.29012\/jpc.v6i2.640","volume":"6","author":"F Niedermeyer","year":"2014","unstructured":"Niedermeyer, F., Steinmetzer, S., Kroll, M., Schnell, R.: Cryptanalysis of basic Bloom filters used for privacy preserving record linkage. JPC 6(2), 59\u201379 (2014)","journal-title":"JPC"},{"key":"42_CR16","first-page":"205","volume":"50","author":"S Randall","year":"2014","unstructured":"Randall, S., Ferrante, A., Boyd, J., Bauer, J., Semmens, J.: Privacy-preserving record linkage on large real world datasets. JBI 50, 205\u2013212 (2014)","journal-title":"JBI"},{"issue":"1","key":"42_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1472-6947-9-41","volume":"9","author":"R Schnell","year":"2009","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: Privacy-preserving record linkage using Bloom filters. BMC Med. Inform. Decis. Making 9(1), 41 (2009)","journal-title":"BMC Med. Inform. Decis. Making"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Schnell, R., Borgs, C.: Randomized response and balanced Bloom filters for privacy preserving record linkage. In: ICDMW DINA, Barcelona (2016)","DOI":"10.1109\/ICDMW.2016.0038"},{"key":"42_CR19","first-page":"285","volume":"59","author":"D Vatsalan","year":"2016","unstructured":"Vatsalan, D., Christen, P.: Privacy-preserving matching of similar patients. JBI 59, 285\u2013298 (2016)","journal-title":"JBI"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/978-3-319-49340-4_25","volume-title":"Handbook of Big Data Technologies","author":"D Vatsalan","year":"2017","unstructured":"Vatsalan, D., Sehili, Z., Christen, P., Rahm, E.: Privacy-preserving record linkage for big data: current approaches and research challenges. In: Zomaya, A.Y., Sakr, S. (eds.) Handbook of Big Data Technologies, pp. 851\u2013895. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49340-4_25"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93040-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:08:03Z","timestamp":1710324483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93040-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930398","9783319930404"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93040-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/prada-research.net\/pakdd18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}