{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T00:50:07Z","timestamp":1763599807587,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180311"},{"type":"electronic","value":"9783319180328"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18032-8_43","type":"book-chapter","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T05:41:54Z","timestamp":1431063714000},"page":"549-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Clustering-Based Scalable Indexing for Multi-party Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Thilina","family":"Ranbaduge","sequence":"first","affiliation":[]},{"given":"Dinusha","family":"Vatsalan","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Al-Lawati, A., Lee, D., McDaniel, P.: Blocking-aware private record linkage. In: ACM IQIS, pp. 59\u201368, Baltimore (2005)","key":"43_CR1","DOI":"10.1145\/1077501.1077513"},{"issue":"7","key":"43_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. Communications of the ACM 13(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Christen, P.: Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer (2012)","key":"43_CR3","DOI":"10.1007\/978-3-642-31164-2"},{"issue":"9","key":"43_CR4","first-page":"1537","volume":"24","author":"P Christen","year":"2012","unstructured":"Christen, P.: A survey of indexing techniques for scalable record linkage and deduplication. IEEE TKDE 24(9), 1537\u20131555 (2012)","journal-title":"IEEE TKDE"},{"issue":"2","key":"43_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.: Tools for privacy preserving distributed data mining. SIGKDD Explorations 4(2), 28\u201334 (2002)","journal-title":"SIGKDD Explorations"},{"doi-asserted-by":"crossref","unstructured":"Cohen, W.W., Richman, J.: Learning to match and cluster large high-dimensional data sets for data integration. In: ACM SIGKDD, pp. 475\u2013480, Edmonton (2002)","key":"43_CR6","DOI":"10.1145\/775047.775116"},{"unstructured":"Durham, E.: A framework for accurate, efficient private record linkage. Ph.D. thesis, Faculty of the Graduate School of Vanderbilt University, Nashville, TN (2012)","key":"43_CR7"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.5626\/JCSE.2011.5.3.223","volume":"5","author":"A Karakasidis","year":"2011","unstructured":"Karakasidis, A., Verykios, V.: Secure blocking+secure matching = secure record linkage. Journal of Computing Science and Engineering 5, 223\u2013235 (2011)","journal-title":"Journal of Computing Science and Engineering"},{"issue":"1","key":"43_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/1748-7188-5-9","volume":"5","author":"TG Kristensen","year":"2010","unstructured":"Kristensen, T.G., Nielsen, J., Pedersen, C.N.: A tree-based method for the rapid screening of chemical fingerprints. Algo. for Molecular Biology 5(1), 9 (2010)","journal-title":"Algo. for Molecular Biology"},{"doi-asserted-by":"crossref","unstructured":"Kuzu, M., Kantarcioglu, M., Inan, A., Bertino, E., Durham, E., Malin, B.: Efficient privacy-aware record integration. In: ACM EDBT, Genoa, Italy (2013)","key":"43_CR10","DOI":"10.1145\/2452376.2452398"},{"unstructured":"Lai, P., Yiu, S., Chow, K., Chong, C., Hui, L.: An efficient Bloom filter based solution for multiparty private matching. In: SAM, Las Vegas (2006)","key":"43_CR11"},{"doi-asserted-by":"crossref","unstructured":"McCallum, A., Nigam, K., Ungar, L.H.: Efficient clustering of high-dimensional data sets with application to reference matching. In: ACM SIGKDD, Boston (2000)","key":"43_CR12","DOI":"10.1145\/347090.347123"},{"doi-asserted-by":"crossref","unstructured":"Ranbaduge, T., Vatsalan, D., Christen, P.: Tree based scalable indexing for multi-party privacy-preserving record linkage. In: AusDM, CRPIT 158, Brisbane (2014)","key":"43_CR13","DOI":"10.1109\/ICDMW.2015.101"},{"doi-asserted-by":"crossref","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: Privacy-preserving record linkage using Bloom filters. BMC Medical Informatics and Decision Making 9(1) (2009)","key":"43_CR14","DOI":"10.1186\/1472-6947-9-41"},{"unstructured":"Schnell, R.: Privacy-preserving record linkage and privacy-preserving blocking for large files with cryptographic keys using multibit trees. In: JSM, Montreal (2013)","key":"43_CR15"},{"issue":"6","key":"43_CR16","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. JIS 38(6), 946\u2013969 (2013)","journal-title":"JIS"},{"doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P.: Scalable privacy-preserving record linkage for multiple databases. In: ACM CIKM, pp. 1795\u20131798, Shanghai (2014)","key":"43_CR17","DOI":"10.1145\/2661829.2661875"},{"issue":"1","key":"43_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.29012\/jpc.v6i1.636","volume":"6","author":"D Vatsalan","year":"2014","unstructured":"Vatsalan, D., Christen, P., O\u2019Keefe, C.M., Verykios, V.: An evaluation framework for privacy-preserving record linkage. JPC 6(1), 35\u201375 (2014)","journal-title":"JPC"},{"doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Verykios, V.: Efficient two-party private blocking based on sorted nearest neighborhood clustering. In: ACM CIKM, San Francisco (2013)","key":"43_CR19","DOI":"10.1145\/2505515.2505757"}],"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-18032-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:57:01Z","timestamp":1676941021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18032-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180311","9783319180328"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18032-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}