{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T00:18:26Z","timestamp":1773879506640,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319574530","type":"print"},{"value":"9783319574547","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57454-7_49","type":"book-chapter","created":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T12:09:31Z","timestamp":1492862971000},"page":"628-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Peter","family":"Christen","sequence":"first","affiliation":[]},{"given":"Rainer","family":"Schnell","sequence":"additional","affiliation":[]},{"given":"Dinusha","family":"Vatsalan","sequence":"additional","affiliation":[]},{"given":"Thilina","family":"Ranbaduge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,23]]},"reference":[{"issue":"7","key":"49_CR1","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":"49_CR2","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). doi:10.1007\/978-3-319-23633-9_11"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1132956.1132958","volume":"3","author":"A Ceglar","year":"2006","unstructured":"Ceglar, A., Roddick, J.F.: Association mining. ACM CSUR 3(2), 5 (2006)","journal-title":"ACM CSUR"},{"key":"49_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching \u2013 Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching \u2013 Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Heidelberg (2012)"},{"issue":"12","key":"49_CR5","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"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-319-06608-0_40","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Z Fu","year":"2014","unstructured":"Fu, Z., Christen, P., Zhou, J.: A graph matching method for historical census household linkage. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS (LNAI), vol. 8443, pp. 485\u2013496. Springer, Cham (2014). doi:10.1007\/978-3-319-06608-0_40"},{"key":"49_CR7","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-27707-3_21","volume-title":"Biomedical Engineering Systems and Technologies","author":"M Kroll","year":"2015","unstructured":"Kroll, M., Steinmetzer, S.: Who is 1011011111$$\\ldots $$1110110010? Automated cryptanalysis of Bloom filter encryptions of databases with several personal identifiers. In: Fred, A., Gamboa, H., Elias, D. (eds.) BIOSTEC 2015. CCIS, vol. 574, pp. 341\u2013356. Springer, Cham (2015). doi:10.1007\/978-3-319-27707-3_21"},{"key":"49_CR8","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). doi:10.1007\/978-3-642-22263-4_13"},{"issue":"2","key":"49_CR9","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":"2","key":"49_CR10","doi-asserted-by":"crossref","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":"49_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-31750-2_33","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T Ranbaduge","year":"2016","unstructured":"Ranbaduge, T., Vatsalan, D., Christen, P., Verykios, V.: Hashing-based distributed multi-party blocking for privacy-preserving record linkage. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9652, pp. 415\u2013427. Springer, Cham (2016). doi:10.1007\/978-3-319-31750-2_33"},{"key":"49_CR12","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":"49_CR13","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. Mak. 9(1), 41 (2009)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: A novel error-tolerant anonymous linking code. In: Working Paper, German Record Linkage Center (2011)","DOI":"10.2139\/ssrn.3549247"},{"key":"49_CR15","doi-asserted-by":"publisher","unstructured":"Schnell, R., Borgs, C.: Randomized response and balanced Bloom filters for privacy preserving record linkage. In: ICDMW DINA, pp. 218\u2013224 (2016). doi:10.1109\/ICDMW.2016.0038","DOI":"10.1109\/ICDMW.2016.0038"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P.: Scalable privacy-preserving record linkage for multiple databases. In: ACM CIKM, Shanghai (2014)","DOI":"10.1145\/2661829.2661875"},{"key":"49_CR17","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"},{"issue":"6","key":"49_CR18","first-page":"946","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P., Verykios, V.: A taxonomy of privacy-preserving record linkage techniques. IS 38(6), 946\u2013969 (2013)","journal-title":"IS"}],"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-57454-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:19:07Z","timestamp":1710346747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57454-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319574530","9783319574547"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57454-7_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 April 2017","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":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd2017.snu.ac.kr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}