{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:49Z","timestamp":1740109309774,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Australian Research Council Discovery Projects","award":["DP130101801","DP160101934"],"award-info":[{"award-number":["DP130101801","DP160101934"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10115-019-01370-1","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T12:02:22Z","timestamp":1560254542000},"page":"45-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A scalable privacy-preserving framework for temporal record linkage"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5405-3704","authenticated-orcid":false,"given":"Thilina","family":"Ranbaduge","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-2015","authenticated-orcid":false,"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,11]]},"reference":[{"key":"1370_CR1","doi-asserted-by":"crossref","unstructured":"Chiang YH, Doan A, Naughton JF (2014) Modeling entity evolution for temporal record matching. In: ACM SIGMOD, pp 1175\u20131186","DOI":"10.1145\/2588555.2588560"},{"key":"1370_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data matching\u2013concepts and techniques for record linkage, entity resolution, and duplicate detection","author":"P Christen","year":"2012","unstructured":"Christen P (2012) Data matching\u2013concepts and techniques for record linkage, entity resolution, and duplicate detection. Springer, Berlin"},{"key":"1370_CR3","doi-asserted-by":"crossref","unstructured":"Christen P, Gayler RW (2013) Adaptive temporal entity resolution on dynamic databases. In: PAKDD. Springer, pp 558\u2013569","DOI":"10.1007\/978-3-642-37456-2_47"},{"key":"1370_CR4","doi-asserted-by":"crossref","unstructured":"Christen P, Vatsalan D, Wang Q (2015) Efficient entity resolution with adaptive and interactive training data selection. In: IEEE ICDM","DOI":"10.1109\/ICDM.2015.63"},{"key":"1370_CR5","doi-asserted-by":"crossref","unstructured":"Christen P, Schnell R, Vatsalan D, Ranbaduge T (2017a) Efficient cryptanalysis of Bloom filters for privacy-preserving record linkage. In: PAKDD","DOI":"10.1007\/978-3-319-57454-7_49"},{"key":"1370_CR6","unstructured":"Christen V, Gro\u00df A, Fisher J, Wang Q, Christen P, Rahm E (2017b) Temporal group linkage and evolution analysis for census data. In: EDBT, pp 620\u2013631"},{"issue":"2","key":"1370_CR7","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 (2002) Tools for privacy preserving distributed data mining. SIGKDD Explor 4(2):28\u201334","journal-title":"SIGKDD Explor"},{"key":"1370_CR8","doi-asserted-by":"crossref","unstructured":"Durham EA, Toth C, Kuzu M, Kantarcioglu M, Xue Y, Malin B (2013) Composite Bloom filters for secure record linkage. In: TKDE","DOI":"10.1109\/TKDE.2013.91"},{"issue":"3","key":"1370_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11222-017-9746-6","volume":"28","author":"D Hand","year":"2018","unstructured":"Hand D, Christen P (2018) A note on using the F-measure for evaluating record linkage algorithms. Stat Comput 28(3):539\u2013547","journal-title":"Stat Comput"},{"key":"1370_CR10","doi-asserted-by":"crossref","unstructured":"Hu Y, Wang Q, Vatsalan D, Christen P (2017) Improving temporal record linkage using regression classification. In: PAKDD","DOI":"10.1007\/978-3-319-57454-7_44"},{"key":"1370_CR11","doi-asserted-by":"crossref","unstructured":"Inan A, Kantarcioglu M, Ghinita G, Bertino E (2010) Private record matching using differential privacy. In: International conference on extending database technology. ACM, pp 123\u2013134","DOI":"10.1145\/1739041.1739059"},{"issue":"3","key":"1370_CR12","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 (2011) Secure blocking+ secure matching= secure record linkage. J Comput Sci Eng 5(3):223\u2013235","journal-title":"J Comput Sci Eng"},{"key":"1370_CR13","doi-asserted-by":"crossref","unstructured":"Li F, Lee ML, Hsu W, Tan WC (2015) Linking temporal records for profiling entities. In: ACM SIGMOD, pp 593\u2013605","DOI":"10.1145\/2723372.2737789"},{"issue":"11","key":"1370_CR14","doi-asserted-by":"crossref","first-page":"956","DOI":"10.14778\/3402707.3402733","volume":"4","author":"P Li","year":"2011","unstructured":"Li P, Dong XL, Maurino A, Srivastava D (2011) Linking temporal records. VLDB Endowment 4(11):956\u2013967","journal-title":"VLDB Endowment"},{"key":"1370_CR15","unstructured":"Lin HY, Tzeng WG (2005) An efficient solution to the Millionaires\u2019 problem based on homomorphic encryption. In: Applied cryptography and network security. Springer, pp 456\u2013466"},{"issue":"1","key":"1370_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.29012\/jpc.v1i1.566","volume":"1","author":"Y Lindell","year":"2009","unstructured":"Lindell Y, Pinkas B (2009) Secure multiparty computation for privacy-preserving data mining. JPC 1(1):5","journal-title":"JPC"},{"key":"1370_CR17","unstructured":"Lyubashevsky V, Peikert C, Regev O (2012) On ideal lattices and learning with errors over rings. Cryptology ePrint Archive, Report 2012\/230, https:\/\/eprint.iacr.org\/2012\/230"},{"key":"1370_CR18","doi-asserted-by":"crossref","unstructured":"Naehrig M, Lauter K, Vaikuntanathan V (2011) Can homomorphic encryption be practical? In: 3rd ACM workshop on cloud computing security workshop. ACM","DOI":"10.1145\/2046660.2046682"},{"key":"1370_CR19","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT. Springer, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"1370_CR20","doi-asserted-by":"crossref","unstructured":"Ranbaduge T, Christen P (2018) Privacy-preserving temporal record linkage. In: IEEE ICDM, pp 1161\u20131171","DOI":"10.1109\/ICDM.2018.00053"},{"key":"1370_CR21","doi-asserted-by":"crossref","unstructured":"Ranbaduge T, Vatsalan D, Christen P (2014) Tree based scalable indexing for multi-party privacy-preserving record linkage. In: AusDM, CRPIT 158. Brisbane","DOI":"10.1109\/ICDMW.2015.101"},{"key":"1370_CR22","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-319-18032-8_43","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Thilina Ranbaduge","year":"2015","unstructured":"Ranbaduge T, Vatsalan D, Christen P (2015) Clustering-based scalable indexing for multi-party privacy-preserving record linkage. In: PAKDD\u201909. Springer LNAI, Vietnam"},{"key":"1370_CR23","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1186\/1472-6947-13-64","volume":"13","author":"S Randall","year":"2013","unstructured":"Randall S, Ferrante A, Boyd J, Semmens J (2013) The effect of data cleaning on record linkage quality. BMC Med Inform Decis Mak 13:64","journal-title":"BMC Med Inform Decis Mak"},{"key":"1370_CR24","first-page":"205","volume":"50","author":"SM Randall","year":"2014","unstructured":"Randall SM, Ferrante AM, Boyd JH, Bauer JK, Semmens JB (2014) Privacy-preserving record linkage on large real world datasets. JBI 50:205","journal-title":"JBI"},{"key":"1370_CR25","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 (2009) Privacy-preserving record linkage using Bloom filters. BMC Med Inform Decis Mak 9:41","journal-title":"BMC Med Inform Decis Mak"},{"issue":"5","key":"1370_CR26","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) K-anonymity: a model for protecting privacy. Int J Uncertain Fuzziness Knowl Based Syst 10(5):557\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"1370_CR27","unstructured":"Vatsalan D, Christen P (2012) An iterative two-party protocol for scalable privacy-preserving record linkage. In: AusDM, CRPIT 134. Sydney, Australia"},{"key":"1370_CR28","doi-asserted-by":"crossref","unstructured":"Vatsalan D, Christen P (2013) Sorted nearest neighborhood clustering for efficient private blocking. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 341\u2013352","DOI":"10.1007\/978-3-642-37456-2_29"},{"key":"1370_CR29","doi-asserted-by":"crossref","unstructured":"Vatsalan D, Christen P (2014) Scalable privacy-preserving record linkage for multiple databases. In: ACM CIKM, pp 1795\u20131798","DOI":"10.1145\/2661829.2661875"},{"key":"1370_CR30","unstructured":"Vatsalan D, Christen P (2016) Multi-party privacy-preserving record linkage using Bloom filters. arXiv preprint arXiv:1612.08835"},{"key":"1370_CR31","doi-asserted-by":"crossref","unstructured":"Vatsalan D, Christen P, Verykios V (2013a) Efficient two-party private blocking based on sorted nearest neighborhood clustering. In: ACM CIKM. San Francisco, pp 1949\u20131958","DOI":"10.1145\/2505515.2505757"},{"issue":"6","key":"1370_CR32","first-page":"946","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan D, Christen P, Verykios VS (2013b) A taxonomy of privacy-preserving record linkage techniques. JIS 38(6):946","journal-title":"JIS"},{"key":"1370_CR33","first-page":"851","volume-title":"Privacy-preserving record linkage for big data: current approaches and research challenges","author":"D Vatsalan","year":"2017","unstructured":"Vatsalan D, Sehili Z, Christen P, Rahm E (2017) Privacy-preserving record linkage for big data: current approaches and research challenges. Springer, Berlin, pp 851\u2013895"},{"key":"1370_CR34","doi-asserted-by":"crossref","unstructured":"Yakout M, Atallah M, Elmagarmid A (2009) Efficient private record linkage. In: IEEE international conference on data engineering, pp 1283\u20131286","DOI":"10.1109\/ICDE.2009.221"},{"key":"1370_CR35","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: IEEE SFCS","DOI":"10.1109\/SFCS.1982.38"},{"issue":"13","key":"1370_CR36","doi-asserted-by":"publisher","first-page":"2194","DOI":"10.1002\/sec.1164","volume":"8","author":"M Yasuda","year":"2015","unstructured":"Yasuda M, Shimoyama T, Kogure J, Yokoyama K, Koshiba T (2015) New packing method in somewhat homomorphic encryption and its applications. Secur Commun Netw 8(13):2194\u20132213","journal-title":"Secur Commun Netw"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01370-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-019-01370-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01370-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T10:36:13Z","timestamp":1694946973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-019-01370-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,11]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1370"],"URL":"https:\/\/doi.org\/10.1007\/s10115-019-01370-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2019,6,11]]},"assertion":[{"value":"31 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}