{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T14:06:28Z","timestamp":1790690788044,"version":"4.1.0"},"publisher-location":"Cham","reference-count":176,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319493398","type":"print"},{"value":"9783319493404","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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-49340-4_25","type":"book-chapter","created":{"date-parts":[[2017,2,25]],"date-time":"2017-02-25T03:23:30Z","timestamp":1487993010000},"page":"851-895","source":"Crossref","is-referenced-by-count":108,"title":["Privacy-Preserving Record Linkage for Big Data: Current Approaches and Research Challenges"],"prefix":"10.1007","author":[{"given":"Dinusha","family":"Vatsalan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziad","family":"Sehili","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erhard","family":"Rahm","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,2,26]]},"reference":[{"key":"25_CR1","unstructured":"R.\u00a0Agrawal, A.\u00a0Evfimievski, R.\u00a0Srikant, Information sharing across private databases, in ACM SIGMOD (2003), pp. 86\u201397"},{"key":"25_CR2","unstructured":"A.\u00a0Arasu, V.\u00a0Ganti, R.\u00a0Kaushik, Efficient exact set-similarity joins, in PVLDB (2006), pp. 918\u2013929"},{"key":"25_CR3","unstructured":"A.\u00a0Arasu, M.\u00a0G\u00f6tz, R.\u00a0Kaushik, On active learning of record matching packages, in ACM SIGMOD (2010), pp. 783\u2013794"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Aumann, Y.\u00a0Lindell, Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010)","DOI":"10.1007\/s00145-009-9040-7"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"T.\u00a0Bachteler, J.\u00a0Reiher, and R.\u00a0Schnell. Similarity Filtering with Multibit Trees for Record Linkage. Technical Report WP-GRLC-2013-01, German Record Linkage Center, 2013","DOI":"10.2139\/ssrn.3530899"},{"key":"25_CR6","unstructured":"D. Barone, A. Maurino, F. Stella, C. Batini, A privacy-preserving framework for accuracy and completeness quality assessment, in Emerging Paradigms in Informatics, Systems and Communication (2009), pp. 83\u201387"},{"key":"25_CR7","unstructured":"J.E. Barros, J.C. French, W.N. Martin, P.M. Kelly, T.M. Cannon, Using the triangle inequality to reduce the number of comparisons required for similarity-based retrieval, in Electronic Imaging Science and Technology (1996), pp. 392\u2013403"},{"key":"25_CR8","unstructured":"C. Batini, M. Scannapieca, Data quality: Concepts, Methodologies And Techniques. Data-Centric Systems and Applications (Springer, Berlin, 2006)"},{"key":"25_CR9","unstructured":"R. Baxter, P. Christen, T. Churches, A comparison of fast blocking methods for record linkage, in SIGKDD Workshop on Data Cleaning, Record Linkage and Object Consolidation (2003), pp. 25\u201327"},{"key":"25_CR10","unstructured":"R.J. Bayardo, Y.\u00a0Ma, R.\u00a0Srikant, Scaling Up All Pairs Similarity Search, in WWW (2007), pp. 131\u2013140"},{"key":"25_CR11","unstructured":"K.\u00a0Bellare, S.\u00a0Iyengar, A.G. Parameswaran, V.\u00a0Rastogi, Active sampling for entity matching, in ACM SIGKDD (2012), pp. 1131\u20131139"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"A. Berman, L.G. Shapiro, Selecting good keys for triangle-inequality-based pruning algorithms, in IEEE Workshop on Content-Based Access of Image and Video Database (1998), pp. 12\u201319","DOI":"10.1109\/CAIVD.1998.646029"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"I.\u00a0Bhattacharya, L.\u00a0Getoor, Collective entity resolution in relational data. ACM TKDD 1(1), 1\u201335 (2007)","DOI":"10.1145\/1217299.1217304"},{"key":"25_CR14","unstructured":"M.\u00a0Bilenko, R.J. Mooney, Adaptive duplicate detection using learnable string similarity measures, in ACM SIGKDD (2003), pp. 39\u201348"},{"issue":"7","key":"25_CR15","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"B. Bloom, Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"25_CR16","unstructured":"L.\u00a0Bonomi, L.\u00a0Xiong, R.\u00a0Chen, B.\u00a0Fung, Frequent grams based embedding for privacy preserving record linkage, in ACM CIKM (2012), pp. 1597\u20131601"},{"key":"25_CR17","unstructured":"H.\u00a0Bouzelat, C.\u00a0Quantin, L.\u00a0Dusserre, Extraction and anonymity protocol of medical file, in AMIA Fall Symposium (1996), pp. 323\u2013327"},{"key":"25_CR18","unstructured":"A.Z. Broder, On the resemblance and containment of documents, in Compression and Complexity of Sequences. IEEE (1997), pp. 21\u201329"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"A.\u00a0Broder, M.\u00a0Mitzenmacher, A.\u00a0Mitzenmacher, Network applications of Bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2004)","DOI":"10.1080\/15427951.2004.10129096"},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1111\/j.1753-6405.2008.00160.x","volume":"32","author":"E Brook","year":"2008","unstructured":"E. Brook, D. Rosman, C. Holman, Public good through data linkage: measuring research outputs from the Western Australian data linkage system. Aust. NZ J. Public Health 32, 19\u201323 (2008)","journal-title":"Aust. NZ J. Public Health"},{"issue":"1","key":"25_CR21","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"25_CR22","unstructured":"A. Cavoukian, J. Jonas, Privacy by design in the age of Big Data. Technical report, TR Information and privacy commissioner, Ontario (2012)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"P.\u00a0Christen, A comparison of personal name matching: techniques and practical issues, in IEEE ICDM Workshop on Mining Complex Data (2006), pp. 290\u2013294","DOI":"10.1109\/ICDMW.2006.2"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"P.\u00a0Christen, Privacy-preserving data linkage and geocoding: current approaches and research directions, in IEEE ICDM Workshop on Privacy Aspects of Data Mining (2006), pp. 497\u2013501","DOI":"10.1109\/ICDMW.2006.135"},{"key":"25_CR25","unstructured":"P.\u00a0Christen, Automatic record linkage using seeded nearest neighbour and support vector machine classification, in ACM SIGKDD (2008), pp. 151\u2013159"},{"key":"25_CR26","unstructured":"P.\u00a0Christen, Febrl: an open source data cleaning, deduplication and record linkage system with a graphical user interface, in ACM SIGKDD (2008), pp. 1065\u20131068"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"P.\u00a0Christen, Geocode matching and privacy preservation, in Workshop on Privacy, Security, and Trust in KDD (Springer, Berlin, 2009), pp. 7\u201324","DOI":"10.1007\/978-3-642-01718-6_2"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"P.\u00a0Christen, Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection (Springer, Berlin, 2012)","DOI":"10.1007\/978-3-642-31164-2"},{"issue":"9","key":"25_CR29","first-page":"1537","volume":"24","author":"P Christen","year":"2012","unstructured":"P. Christen, A survey of indexing techniques for scalable record linkage and deduplication. IEEE TKDE 24(9), 1537\u20131555 (2012)","journal-title":"IEEE TKDE"},{"key":"25_CR30","unstructured":"P.\u00a0Christen, T.\u00a0Churches, M.\u00a0Hegland, Febrl \u2013 a parallel open source data linkage system, in Springer PAKDD (2004), pp. 638\u2013647"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"P.\u00a0Christen, K.\u00a0Goiser, Quality and complexity measures for data linkage and deduplication, in Quality Measures in Data Mining, vol.\u00a043. Studies in Computational Intelligence (Springer, Berlin, 2007), pp. 127\u2013151","DOI":"10.1007\/978-3-540-44918-8_6"},{"key":"25_CR32","unstructured":"P.\u00a0Christen, R.\u00a0Gayler, D.\u00a0Hawking, Similarity-aware indexing for real-time entity resolution, in ACM CIKM (2009), pp. 1565\u20131568"},{"key":"25_CR33","unstructured":"P.\u00a0Christen, R.W. Gayler, Adaptive temporal entity resolution on dynamic databases, in PAKDD (2013), pp. 558\u2013569"},{"key":"25_CR34","unstructured":"P.\u00a0Christen, D.\u00a0Vatsalan, Flexible and extensible generation and corruption of personal data, in ACM CIKM (2013), pp. 1165\u20131168"},{"key":"25_CR35","doi-asserted-by":"crossref","unstructured":"T. Churches, P. Christen, Some methods for blindfolded record linkage. BioMed Cent. Med. Inf. Decision Mak. 4(9), (2004)","DOI":"10.1186\/1472-6947-4-9"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"T. Churches, P. Christen, K. Lim, J.X. Zhu, Preparation of name and address data for record linkage using hidden Markov models. BioMed Cent. Med. Inf. Decision Mak. 2(9), (2002)","DOI":"10.1186\/1472-6947-2-9"},{"key":"25_CR37","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1136\/ip.2003.004580","volume":"10","author":"DE Clark","year":"2004","unstructured":"D.E. Clark, Practical introduction to record linkage for injury research. Inj. Prev. 10, 186\u2013191 (2004)","journal-title":"Inj. Prev."},{"issue":"2","key":"25_CR38","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, M. Zhu, Tools for privacy preserving distributed data mining. SIGKDD Explor. 4(2), 28\u201334 (2002)","journal-title":"SIGKDD Explor."},{"issue":"3","key":"25_CR39","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/352595.352598","volume":"18","author":"WW Cohen","year":"2000","unstructured":"W.W. Cohen, Data integration using similarity joins and a word-based information representation language. ACM TOIS 18(3), 288\u2013321 (2000)","journal-title":"ACM TOIS"},{"key":"25_CR40","unstructured":"W.W. Cohen, J.\u00a0Richman, Learning to match and cluster large high-dimensional data sets for data integration, in ACM SIGKDD (2002), pp. 475\u2013480"},{"issue":"1","key":"25_CR41","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"G. Cormode, S. Muthukrishnan, An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"25_CR42","doi-asserted-by":"crossref","unstructured":"G.\u00a0Dal\u00a0Bianco, R.\u00a0Galante, C.A. Heuser, A fast approach for parallel deduplication on multicore processors, in ACM Symposium on Applied Computing (2011), pp. 1027\u20131032","DOI":"10.1145\/1982185.1982411"},{"key":"25_CR43","doi-asserted-by":"crossref","unstructured":"D. Dey, V. Mookerjee, D. Liu, Efficient techniques for online record linkage. IEEE TKDE 23(3), 373\u2013387 (2010)","DOI":"10.1109\/TKDE.2010.134"},{"key":"25_CR44","doi-asserted-by":"crossref","unstructured":"W.\u00a0Du, M.\u00a0Atallah, Protocols for secure remote database access with approximate matching, in ACM WSPEC (Springer, Berlin, 2000), pp. 87\u2013111","DOI":"10.1007\/978-1-4615-1467-1_6"},{"key":"25_CR45","doi-asserted-by":"crossref","unstructured":"G.T. Duncan, M.\u00a0Elliot, J.-J. Salazar-Gonz\u00e1lez, Statistical Confidentiality: Principles and Practice (Springer, New York, 2011)","DOI":"10.1007\/978-1-4419-7802-8"},{"key":"25_CR46","unstructured":"E.\u00a0Durham, A framework for accurate, efficient private record linkage. Ph.D. thesis, Faculty of the Graduate School of Vanderbilt University, Nashville, TN, 2012"},{"key":"25_CR47","unstructured":"E.\u00a0Durham, Y.\u00a0Xue, M.\u00a0Kantarcioglu, B.\u00a0Malin, Private medical record linkage with approximate matching, in AMIA Annual Symposium (2010), pp. 182\u2013186"},{"key":"25_CR48","doi-asserted-by":"crossref","unstructured":"E.A. Durham, C.\u00a0Toth, M.\u00a0Kuzu, M.\u00a0Kantarcioglu, Y.\u00a0Xue, B.\u00a0Malin, Composite Bloom filters for secure record linkage. IEEE TKDE 26(12), pp. 2956\u20132968 (2013)","DOI":"10.1109\/TKDE.2013.91"},{"key":"25_CR49","unstructured":"L. Dusserre, C. Quantin, H. Bouzelat, A one way public key cryptosystem for the linkage of nominal files in epidemiological studies. Medinfo 8, 644\u2013647 (1995)"},{"key":"25_CR50","unstructured":"C. Dwork, Differential privacy, in ICALP (2006), pp. 1\u201312"},{"key":"25_CR51","unstructured":"M.G. Elfeky, V.S. Verykios, A.K. Elmagarmid, TAILOR: a record linkage toolbox, in IEEE ICDE (2002), pp. 17\u201328"},{"issue":"1","key":"25_CR52","first-page":"1","volume":"19","author":"A Elmagarmid","year":"2007","unstructured":"A. Elmagarmid, P. Ipeirotis, V.S. Verykios, Duplicate record detection: a survey. IEEE TKDE 19(1), 1\u201316 (2007)","journal-title":"IEEE TKDE"},{"key":"25_CR53","unstructured":"U.\u00a0Fayyad, G.\u00a0Piatetsky-Shapiro, P.\u00a0Smyth, R.\u00a0Uthurusamy, Advances in Knowledge Discovery and Data Mining (The MIT Press, Cambridge, 1996)"},{"issue":"328","key":"25_CR54","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","volume":"64","author":"IP Fellegi","year":"1969","unstructured":"I.P. Fellegi, A.B. Sunter, A theory for record linkage. J. Am. Stat. Soc. 64(328), 1183\u20131210 (1969)","journal-title":"J. Am. Stat. Soc."},{"key":"25_CR55","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/B0-12-369398-5\/00053-0","volume":"1","author":"SE Fienberg","year":"2005","unstructured":"S.E. Fienberg, Confidentiality and disclosure limitation. Encycl. Soc. Meas. 1, 463\u2013469 (2005)","journal-title":"Encycl. Soc. Meas."},{"key":"25_CR56","unstructured":"B.\u00a0Forchhammer, T.\u00a0Papenbrock, T.\u00a0Stening, S.\u00a0Viehmeier, U.\u00a0Draisbach, F.\u00a0Naumann, Duplicate detection on GPUs, in BTW (2013), pp. 165\u2013184"},{"key":"25_CR57","unstructured":"M.\u00a0Freedman, Y.\u00a0Ishai, B.\u00a0Pinkas, O.\u00a0Reingold, Keyword search and oblivious pseudorandom functions, in Theory of Cryptography (2005), pp. 303\u2013324"},{"key":"25_CR58","doi-asserted-by":"crossref","unstructured":"Z. Fu, J. Zhou, P. Christen, M. Boot, Multiple instance learning for group record linkage, in PAKDD, Springer LNAI (2012), pp. 171\u2013182","DOI":"10.1007\/978-3-642-30217-6_15"},{"issue":"4","key":"25_CR59","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1749603.1749605","volume":"42","author":"B Fung","year":"2010","unstructured":"B. Fung, K. Wang, R. Chen, P.S. Yu, Privacy-preserving data publishing: a survey of recent developments. ACM Comput. Surv. 42(4), 14 (2010)","journal-title":"ACM Comput. Surv."},{"key":"25_CR60","unstructured":"S.R. Ganta, S.P. Kasiviswanathan, A.\u00a0Smith, Composition attacks and auxiliary information in data privacy, in ACM SIGKDD (2008), pp. 265\u2013273"},{"key":"25_CR61","unstructured":"A.\u00a0Gionis, P.\u00a0Indyk, R.\u00a0Motwani, Similarity search in high dimensions via hashing, in VLDB (1999), pp. 518\u2013529"},{"key":"25_CR62","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, Foundations of Cryptography: Basic Applications, vol.\u00a02. (Cambridge University Press, Cambridge, 2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"25_CR63","doi-asserted-by":"crossref","unstructured":"L. Gu, R. Baxter, Decision models for record linkage, in Selected Papers from AusDM. LNCS, vol. 3755 (Springer, Berlin, 2006), pp. 146\u2013160","DOI":"10.1007\/11677437_12"},{"key":"25_CR64","unstructured":"M.\u00a0Hadjieleftheriou, A.\u00a0Chandel, N.\u00a0Koudas, D.\u00a0Srivastava, Fast indexes and algorithms for set similarity selection queries, in IEEE ICDE (2008), pp. 267\u2013276"},{"key":"25_CR65","unstructured":"R.\u00a0Hall, S.\u00a0Fienberg, Privacy-preserving record linkage, in PSD (2010), pp. 269\u2013283"},{"key":"25_CR66","doi-asserted-by":"crossref","unstructured":"M. Herschel, F. Naumann, S. Szott, M. Taubert, Scalable iterative graph duplicate detection. IEEE TKDE 24(11), 2094\u20132108 (2012)","DOI":"10.1109\/TKDE.2011.99"},{"key":"25_CR67","unstructured":"A.\u00a0Inan, M.\u00a0Kantarcioglu, E.\u00a0Bertino, M.\u00a0Scannapieco, A hybrid approach to private record linkage, in IEEE ICDE (2008), pp. 496\u2013505"},{"key":"25_CR68","unstructured":"A.\u00a0Inan, M.\u00a0Kantarcioglu, G.\u00a0Ghinita, E.\u00a0Bertino. Private record matching using differential privacy, in EDBT (2010), pp. 123\u2013134"},{"key":"25_CR69","doi-asserted-by":"crossref","unstructured":"P. Indyk, R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, in ACM Symposium on the Theory of Computing (1998), pp. 604\u2013613","DOI":"10.1145\/276698.276876"},{"issue":"1\u20132","key":"25_CR70","first-page":"429","volume":"3","author":"E Ioannou","year":"2010","unstructured":"E. Ioannou, W. Nejdl, C. Nieder\u00e9e, Y. Velegrakis, On-the-fly entity-aware query processing in the presence of linkage. PVLDB 3(1\u20132), 429\u2013438 (2010)","journal-title":"PVLDB"},{"key":"25_CR71","unstructured":"W.\u00a0Jiang, C.\u00a0Clifton, Ac-framework for privacy-preserving collaboration, in SDM SIAM (2007), pp. 47\u201356"},{"issue":"1","key":"25_CR72","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.datak.2007.06.014","volume":"65","author":"W Jiang","year":"2008","unstructured":"W. Jiang, C. Clifton, M. Kantarc\u0131o\u011flu, Transforming semi-honest protocols to ensure accountability. Elsevier DKE 65(1), 57\u201374 (2008)","journal-title":"Elsevier DKE"},{"key":"25_CR73","unstructured":"J. Jonas, J. Harper, Effective counterterrorism and the limited role of predictive data mining. Policy Anal. 584, 1\u201312 (2006)"},{"issue":"2","key":"25_CR74","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1145\/1138394.1138401","volume":"31","author":"D Kalashnikov","year":"2006","unstructured":"D. Kalashnikov, S. Mehrotra, Domain-independent data cleaning via analysis of entity-relationship graph. ACM TODS 31(2), 716\u2013767 (2006)","journal-title":"ACM TODS"},{"key":"25_CR75","unstructured":"M.\u00a0Kantarcioglu, W.\u00a0Jiang, B.\u00a0Malin, A privacy-preserving framework for integrating person-specific databases, in PSD (2008), pp. 298\u2013314"},{"key":"25_CR76","doi-asserted-by":"crossref","first-page":"223","DOI":"10.5626\/JCSE.2011.5.3.223","volume":"5","author":"A Karakasidis","year":"2011","unstructured":"A. Karakasidis, V.S. Verykios, Secure blocking $$+$$ secure matching $$=$$ secure record linkage. JCSE 5, 223\u2013235 (2011)","journal-title":"JCSE"},{"key":"25_CR77","unstructured":"A.\u00a0Karakasidis, V.S. Verykios, Reference table based k-anonymous private blocking, in ACM SAC (2012), pp. 859\u2013864"},{"key":"25_CR78","unstructured":"A.\u00a0Karakasidis, V.S. Verykios, A sorted neighborhood approach to multidimensional privacy preserving blocking, in IEEE ICDMW (2012), pp. 937\u2013944"},{"key":"25_CR79","first-page":"9","volume":"7122","author":"A Karakasidis","year":"2012","unstructured":"A. Karakasidis, V.S. Verykios, P. Christen, Fake injection strategies for private phonetic matching. DPM Springer 7122, 9\u201324 (2012)","journal-title":"DPM Springer"},{"key":"25_CR80","unstructured":"D.\u00a0Karapiperis, D.\u00a0Vatsalan, V.S. Verykios, P.\u00a0Christen, Large-scale multi-party counting set intersection using a space efficient global synopsis, in DASFAA (2015), pp. 329\u2013345"},{"key":"25_CR81","unstructured":"D.\u00a0Karapiperis, D.\u00a0Vatsalan, V.S. Verykios, P.\u00a0Christen, Efficient record linkage using a compact hamming space, in EDBT (2016), pp. 209\u2013220"},{"key":"25_CR82","unstructured":"D.\u00a0Karapiperis, V.S. Verykios, A distributed framework for scaling up LSH-based computations in privacy preserving record linkage, in ACM BCI (2013), pp. 102\u2013109"},{"issue":"2","key":"25_CR83","doi-asserted-by":"crossref","first-page":"745","DOI":"10.2298\/CSIS140215040K","volume":"11","author":"D Karapiperis","year":"2014","unstructured":"D. Karapiperis, V.S. Verykios, A distributed near-optimal LSH-based framework for privacy-preserving record linkage. ComSIS 11(2), 745\u2013763 (2014)","journal-title":"ComSIS"},{"issue":"4","key":"25_CR84","first-page":"909","volume":"27","author":"D Karapiperis","year":"2015","unstructured":"D. Karapiperis, V.S. Verykios, An LSH-based blocking approach with a homomorphic matching technique for privacy-preserving record linkage. IEEE TKDE 27(4), 909\u2013921 (2015)","journal-title":"IEEE TKDE"},{"key":"25_CR85","unstructured":"D.\u00a0Karapiperis, V.S. Verykios, A fast and efficient hamming LSH-based scheme for accurate linkage, in Springer KAIS (2016), pp. 1\u201324"},{"key":"25_CR86","unstructured":"H.\u00a0Kargupta, S.\u00a0Datta, Q.\u00a0Wang, K.\u00a0Sivakumar, On the privacy preserving properties of random data perturbation techniques, in IEEE ICDM (2003), p. 99"},{"key":"25_CR87","doi-asserted-by":"crossref","unstructured":"H.\u00a0Kargupta, S.\u00a0Datta, Q.\u00a0Wang, K.\u00a0Sivakumar, Random-data perturbation techniques and privacy-preserving data mining, Springer KAIS 7(4), 387\u2013414 (2005)","DOI":"10.1007\/s10115-004-0173-6"},{"key":"25_CR88","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1111\/j.1467-842X.2002.tb00682.x","volume":"26","author":"CW Kelman","year":"2002","unstructured":"C.W. Kelman, J. Bass, D. Holman, Research use of linked health data - a best practice protocol. Aust. NZ J. Public Health 26, 251\u2013255 (2002)","journal-title":"Aust. NZ J. Public Health"},{"key":"25_CR89","unstructured":"H.\u00a0Kim, D.\u00a0Lee, Harra: fast iterative hashed record linkage for large-scale data collections, in EDBT (2010), pp. 525\u2013536"},{"key":"25_CR90","unstructured":"H.-s. Kim, D.\u00a0Lee, Parallel linkage, in ACM CIKM (2007), pp. 283\u2013292"},{"key":"25_CR91","unstructured":"T.\u00a0Kirsten, L.\u00a0Kolb, M.\u00a0Hartung, A.\u00a0Gro\u00df, H.\u00a0K\u00f6pcke, E.\u00a0Rahm, Data partitioning for parallel entity matching, in QDB (2010)"},{"key":"25_CR92","doi-asserted-by":"crossref","unstructured":"L.\u00a0Kissner, D.\u00a0Song, Private and threshold set-intersection, in Technical Report. Carnegie Mellon University, 2004","DOI":"10.21236\/ADA461119"},{"issue":"12","key":"25_CR93","first-page":"1878","volume":"5","author":"L Kolb","year":"2012","unstructured":"L. Kolb, A. Thor, E. Rahm, Dedoop: efficient deduplication with Hadoop. PVLDB 5(12), 1878\u20131881 (2012)","journal-title":"PVLDB"},{"key":"25_CR94","unstructured":"L.\u00a0Kolb, A.\u00a0Thor, E.\u00a0Rahm, Load balancing for mapreduce-based entity resolution, in IEEE ICDE (2012), pp. 618\u2013629"},{"issue":"2","key":"25_CR95","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.datak.2009.10.003","volume":"69","author":"H K\u00f6pcke","year":"2010","unstructured":"H. K\u00f6pcke, E. Rahm, Frameworks for entity matching: a comparison. Elsevier DKE 69(2), 197\u2013210 (2010)","journal-title":"Elsevier DKE"},{"issue":"1","key":"25_CR96","first-page":"484","volume":"3","author":"H K\u00f6pcke","year":"2010","unstructured":"H. K\u00f6pcke, A. Thor, E. Rahm, Evaluation of entity resolution approaches on real-world match problems. PVLDB 3(1), 484\u2013493 (2010)","journal-title":"PVLDB"},{"key":"25_CR97","doi-asserted-by":"crossref","unstructured":"H.\u00a0Krawczyk, M.\u00a0Bellare, R.\u00a0Canetti, HMAC: keyed-hashing for message authentication, in Internet RFCs (1997)","DOI":"10.17487\/rfc2104"},{"issue":"1","key":"25_CR98","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1186\/1748-7188-5-9","volume":"5","author":"TG Kristensen","year":"2010","unstructured":"T.G. Kristensen, J. Nielsen, C.N. Pedersen, A tree-based method for the rapid screening of chemical fingerprints. Algorithms Mol. Biol. 5(1), 9 (2010)","journal-title":"Algorithms Mol. Biol."},{"key":"25_CR99","doi-asserted-by":"crossref","unstructured":"H.\u00a0Kum, A.\u00a0Krishnamurthy, A.\u00a0Machanavajjhala, S.\u00a0Ahalt, Population informatics: tapping the social genome to advance society: a vision for putting \u201cbig data\u201d to work for population informatics. Computer (2013)","DOI":"10.1109\/MC.2013.405"},{"issue":"2","key":"25_CR100","first-page":"212","volume":"21","author":"H-C Kum","year":"2014","unstructured":"H.-C. Kum, A. Krishnamurthy, A. Machanavajjhala, M.K. Reiter, S. Ahalt, Privacy preserving interactive record linkage. JAMIA 21(2), 212\u2013220 (2014)","journal-title":"JAMIA"},{"key":"25_CR101","first-page":"226","volume":"6794","author":"M Kuzu","year":"2011","unstructured":"M. Kuzu, M. Kantarcioglu, E. Durham, B. Malin, A constraint satisfaction cryptanalysis of Bloom filters in private record linkage. PETS Springer LNCS 6794, 226\u2013245 (2011)","journal-title":"PETS Springer LNCS"},{"issue":"2","key":"25_CR102","first-page":"285","volume":"20","author":"M Kuzu","year":"2013","unstructured":"M. Kuzu, M. Kantarcioglu, E.A. Durham, C. Toth, B. Malin, A practical approach to achieve private medical record linkage in light of public resources. JAMIA 20(2), 285\u2013292 (2013)","journal-title":"JAMIA"},{"key":"25_CR103","unstructured":"M.\u00a0Kuzu, M.\u00a0Kantarcioglu, A.\u00a0Inan, E.\u00a0Bertino, E.\u00a0Durham, B.\u00a0Malin, Efficient privacy-aware record integration, in ACM EDBT (2013), pp. 167\u2013178"},{"key":"25_CR104","unstructured":"P.\u00a0Lai, S.\u00a0Yiu, K.\u00a0Chow, C.\u00a0Chong, L.\u00a0Hui, An efficient Bloom filter based solution for multiparty private matching, in SAM (2006)"},{"key":"25_CR105","doi-asserted-by":"crossref","unstructured":"F.\u00a0Li, Y.\u00a0Chen, B.\u00a0Luo, D.\u00a0Lee, P.\u00a0Liu, Privacy preserving group linkage, in Scientific and Statistical Database Management (Springer, Berlin, 2011), pp. 432\u2013450","DOI":"10.1007\/978-3-642-22351-8_27"},{"key":"25_CR106","unstructured":"N.\u00a0Li, T.\u00a0Li, S.\u00a0Venkatasubramanian, T-closeness: privacy beyond k-anonymity and l-diversity, in IEEE ICDE (2007), pp. 106\u2013115"},{"key":"25_CR107","doi-asserted-by":"crossref","unstructured":"P. Li, X. Dong, A. Maurino, D. Srivastava, Linking temporal records. PVLDB 4(11), 956\u2013967 (2011)","DOI":"10.14778\/3402707.3402733"},{"key":"25_CR108","unstructured":"Z. Lin, M. Hewett, R.B. Altman, Using binning to maintain confidentiality of medical data, in AMIA Symposium (2002), p. 454"},{"key":"25_CR109","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, B.\u00a0Pinkas, Privacy preserving data mining, in CRYPTO (Springer, Berlin, 2000), pp. 36\u201354","DOI":"10.1007\/3-540-44598-6_3"},{"key":"25_CR110","unstructured":"Y.\u00a0Lindell, B.\u00a0Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries, in EUROCRYPT (2007), pp. 52\u201378"},{"key":"25_CR111","unstructured":"Y. Lindell, B. Pinkas, Secure multiparty computation for privacy-preserving data mining. JPC 1(1), 5 (2009), pp. 59\u201398"},{"key":"25_CR112","unstructured":"H. Liu, H. Wang, Y. Chen, Ensuring data storage security against frequency-based attacks in wireless networks, in DCOSS, Springer LNCS, vol. 6131 (2010), pp. 201\u2013215"},{"key":"25_CR113","unstructured":"H.\u00a0Lu, M.-C. Shan, K.-L. Tan, Optimization of multi-way join queries for parallel execution, in VLDB (1991), pp. 549\u2013560"},{"key":"25_CR114","unstructured":"M.\u00a0Luby, C.\u00a0Rackoff, How to construct pseudo-random permutations from pseudo-random functions, in CRYPTO, vol.\u00a085 (1986), p. 447"},{"issue":"1","key":"25_CR115","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1217299.1217302","volume":"1","author":"A Machanavajjhala","year":"2007","unstructured":"A. Machanavajjhala, D. Kifer, J. Gehrke, M. Venkitasubramaniam, l-diversity: privacy beyond k-anonymity. ACM TKDD 1(1), 3 (2007)","journal-title":"ACM TKDD"},{"issue":"1","key":"25_CR116","first-page":"2","volume":"20","author":"BA Malin","year":"2013","unstructured":"B.A. Malin, K. El Emam, C.M. O\u2019Keefe, Biomedical data privacy: problems, perspectives, and recent advances. JAMIA 20(1), 2\u20136 (2013)","journal-title":"JAMIA"},{"key":"25_CR117","doi-asserted-by":"crossref","unstructured":"M.\u00a0Mitzenmacher, E.\u00a0Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, Cambridge, 2005)","DOI":"10.1017\/CBO9780511813603"},{"issue":"4","key":"25_CR118","first-page":"567","volume":"20","author":"N Mohammed","year":"2011","unstructured":"N. Mohammed, B. Fung, M. Debbabi, Anonymity meets game theory: secure data integration with malicious participants. PVLDB 20(4), 567\u2013588 (2011)","journal-title":"PVLDB"},{"key":"25_CR119","doi-asserted-by":"crossref","unstructured":"M.\u00a0Nentwig, M.\u00a0Hartung, A.-C. Ngonga\u00a0Ngomo, E.\u00a0Rahm, A survey of current link discovery frameworks. Semantic Web Journal (2016)","DOI":"10.3233\/SW-150210"},{"key":"25_CR120","unstructured":"A.N. Ngomo, L.\u00a0Kolb, N.\u00a0Heino, M.\u00a0Hartung, S.\u00a0Auer, E.\u00a0Rahm, When to reach for the cloud: using parallel hardware for link discovery, in ESWC (2013), pp. 275\u2013289"},{"key":"25_CR121","unstructured":"Office\u00a0for National\u00a0Statistics, Beyond 2011 matching anonymous data (2013)"},{"key":"25_CR122","unstructured":"C.\u00a0O\u2019Keefe, M.\u00a0Yung, L.\u00a0Gu, R.\u00a0Baxter, Privacy-preserving data linkage protocols, in ACM WPES (2004), pp. 94\u2013102"},{"key":"25_CR123","unstructured":"B.\u00a0On, N.\u00a0Koudas, D.\u00a0Lee, D.\u00a0Srivastava, Group linkage, in IEEE ICDE (2007), pp. 496\u2013505"},{"key":"25_CR124","doi-asserted-by":"crossref","unstructured":"C.\u00a0Pang, L.\u00a0Gu, D.\u00a0Hansen, A.\u00a0Maeder, Privacy-preserving fuzzy matching using a public reference table, in Intelligent Patient Management, vol. 189. Studies in Computational Intelligence (Springer, Berlin, 2009), pp. 71\u201389","DOI":"10.1007\/978-3-642-00179-6_5"},{"key":"25_CR125","doi-asserted-by":"crossref","unstructured":"C.\u00a0Phua, K.\u00a0Smith-Miles, V.\u00a0Lee, R.\u00a0Gayler, Resilient identity crime detection. IEEE TKDE 24(3), 533\u2013546 (2012)","DOI":"10.1109\/TKDE.2010.262"},{"issue":"2","key":"25_CR126","first-page":"113","volume":"21","author":"C Quantin","year":"1996","unstructured":"C. Quantin, H. Bouzelat, L. Dusserre, Irreversible encryption method by generation of polynomials. Med. Inf. Internet Med. 21(2), 113\u2013121 (1996)","journal-title":"Med. Inf. Internet Med."},{"issue":"1","key":"25_CR127","first-page":"117","volume":"49","author":"C Quantin","year":"1998","unstructured":"C. Quantin, H. Bouzelat, F. Allaert, A. Benhamiche, J. Faivre, L. Dusserre, How to ensure data security of an epidemiological follow-up: quality assessment of an anonymous record linkage procedure. IJMI 49(1), 117\u2013122 (1998)","journal-title":"IJMI"},{"issue":"4","key":"25_CR128","first-page":"3","volume":"23","author":"E Rahm","year":"2000","unstructured":"E. Rahm, H.H. Do, Data cleaning: problems and current approaches. IEEE Data Eng. Bull. 23(4), 3\u201313 (2000)","journal-title":"IEEE Data Eng. Bull."},{"issue":"4","key":"25_CR129","first-page":"15","volume":"6","author":"B Ramadan","year":"2015","unstructured":"B. Ramadan, P. Christen, H. Liang, R.W. Gayler, Dynamic sorted neighborhood indexing for real-time entity resolution. ACM JDIQ 6(4), 15 (2015)","journal-title":"ACM JDIQ"},{"key":"25_CR130","doi-asserted-by":"crossref","unstructured":"T.\u00a0Ranbaduge, P.\u00a0Christen, D.\u00a0Vatsalan, Tree based scalable indexing for multi-party privacy-preserving record linkage, in AusDM (2014)","DOI":"10.1109\/ICDMW.2015.101"},{"key":"25_CR131","unstructured":"T.\u00a0Ranbaduge, D.\u00a0Vatsalan, P.\u00a0Christen, Clustering-based scalable indexing for multi-party privacy-preserving record linkage, in Springer PAKDD (2015), pp. 549\u2013561"},{"key":"25_CR132","unstructured":"T.\u00a0Ranbaduge, D.\u00a0Vatsalan, P.\u00a0Christen, Merlin\u2013a tool for multi-party privacy-preserving record linkage, in IEEE ICDMW (2015), pp. 1640\u20131643"},{"key":"25_CR133","unstructured":"T.\u00a0Ranbaduge, D.\u00a0Vatsalan, P.\u00a0Christen, Hashing-based distributed multi-party blocking for privacy-preserving record linkage, in Springer PAKDD (2016), pp. 415\u2013427"},{"key":"25_CR134","doi-asserted-by":"crossref","unstructured":"T.\u00a0Ranbaduge, D.\u00a0Vatsalan, S.\u00a0Randall, P.\u00a0Christen, Evaluation of advanced techniques for multi-party privacy-preserving record linkage on real-world health databases, in IPDLN (2016)","DOI":"10.1109\/ICDMW.2015.101"},{"key":"25_CR135","unstructured":"S.M. Randall, A.M. Ferrante, J.H. Boyd, J.B. Semmens, Privacy-preserving record linkage on large real world datasets, in Elsevier JBI (2014) volume 50, pp. 205\u2013212"},{"key":"25_CR136","unstructured":"S.M. Randall, A.M. Ferrante, J.H. Boyd, A.P. Brown, J.B. Semmens, Limited privacy protection and poor sensitivity is it time to move on from the statistical linkage key-581? Health Inf. Manag. J. 37, 60\u201362 (2016)"},{"key":"25_CR137","doi-asserted-by":"crossref","unstructured":"V. Rastogi, N. Dalvi, M. Garofalakis, Large-scale collective entity matching. in VLDB 4, 208\u2013218 (2011)","DOI":"10.14778\/1938545.1938546"},{"key":"25_CR138","doi-asserted-by":"crossref","unstructured":"C.\u00a0Rong, W.\u00a0Lu, X.\u00a0Wang, X.\u00a0Du, Y.\u00a0Chen, A.K.H. Tung, Efficient and scalable processing of string similarity join. IEEE TKDE 25(10), 2217\u20132230 (2013)","DOI":"10.1109\/TKDE.2012.195"},{"issue":"1","key":"25_CR139","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1111322.1111326","volume":"36","author":"M Roughan","year":"2006","unstructured":"M. Roughan, Y. Zhang, Secure distributed data-mining and its application to large-scale network measurements. ACM SIGCOMM Comput. Commun. Rev. 36(1), 7\u201314 (2006)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"25_CR140","unstructured":"T.\u00a0Ryan, D.\u00a0Gibson, B.\u00a0Holmes, A national minimum data set for home and community care, in Australian Institute of Health and Welfare (1999)"},{"key":"25_CR141","unstructured":"M.\u00a0Scannapieco, I.\u00a0Figotin, E.\u00a0Bertino, A.\u00a0Elmagarmid, Privacy preserving schema and data matching, in ACM SIGMOD (2007), pp. 653\u2013664"},{"key":"25_CR142","unstructured":"D.A. Schneider, D.J. DeWitt, Tradeoffs in processing complex join queries via hashing in multiprocessor database machines, in VLDB (1990), pp. 469\u2013480"},{"key":"25_CR143","unstructured":"B.\u00a0Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd edn. (Wiley, New York, 1996)"},{"key":"25_CR144","unstructured":"R.\u00a0Schnell, Privacy-preserving record linkage and privacy-preserving blocking for large files with cryptographic keys using multibit trees, in JSM (2013), pp. 187\u2013194"},{"issue":"3","key":"25_CR145","first-page":"263","volume":"30","author":"R Schnell","year":"2014","unstructured":"R. Schnell, An efficient privacy-preserving record linkage technique for administrative data and censuses. Stat. J. IAOS 30(3), 263\u2013270 (2014)","journal-title":"Stat. J. IAOS"},{"issue":"1\u20132","key":"25_CR146","first-page":"125","volume":"33","author":"R Schnell","year":"2004","unstructured":"R. Schnell, T. Bachteler, S. Bender, A toolbox for record linkage. Aust. J. Stat. 33(1\u20132), 125\u2013133 (2004)","journal-title":"Aust. J. Stat."},{"key":"25_CR147","doi-asserted-by":"crossref","unstructured":"R.\u00a0Schnell, T.\u00a0Bachteler, J.\u00a0Reiher, Privacy-preserving record linkage using Bloom filters. BMC Medi. Inf. Decision Mak. 9(1), 41 (2009)","DOI":"10.1186\/1472-6947-9-41"},{"key":"25_CR148","doi-asserted-by":"crossref","unstructured":"R.\u00a0Schnell, T.\u00a0Bachteler, J.\u00a0Reiher, A novel error-tolerant anonymous linking code, in German Record Linkage Center, WP-GRLC-2011-02 (2011)","DOI":"10.2139\/ssrn.3549247"},{"key":"25_CR149","unstructured":"Z.\u00a0Sehili, E.\u00a0Rahm, Speeding up privacy preserving record linkage for metric space similarity measures, in Datenbank-Spektrum (2016), pp. 1\u201310"},{"key":"25_CR150","unstructured":"Z.\u00a0Sehili, L.\u00a0Kolb, C.\u00a0Borgs, R.\u00a0Schnell, E.\u00a0Rahm, Privacy preserving record linkage with PP Join, in BTW Conference (2015)"},{"key":"25_CR151","unstructured":"D.\u00a0Song, D.\u00a0Wagner, A.\u00a0Perrig, Practical techniques for searches on encrypted data, in IEEE Symposium on Security and Privacy (2000), pp. 44\u201355"},{"issue":"5","key":"25_CR152","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"L. Sweeney, K-anonymity: a model for protecting privacy. Int. J. Uncertaint. Fuzziness Knowl. Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertaint. Fuzziness Knowl. Based Syst."},{"key":"25_CR153","unstructured":"K.-N. Tran, D.\u00a0Vatsalan, P.\u00a0Christen, GeCo: an online personal data generator and corruptor, in ACM CIKM (2013), pp. 2473\u20132476"},{"issue":"5","key":"25_CR154","first-page":"253","volume":"17","author":"S Trepetin","year":"2008","unstructured":"S. Trepetin, Privacy-preserving string comparisons in record linkage systems: a review. Inf. Secur. J.: A Global Perspect. 17(5), 253\u2013266 (2008)","journal-title":"Inf. Secur. J.: A Global Perspect."},{"key":"25_CR155","unstructured":"E.\u00a0Turgay, T.\u00a0Pedersen, Y.\u00a0Sayg\u0131n, E.\u00a0Sava\u015f, A.\u00a0Levi, Disclosure risks of distance preserving data transformations, in Springer SSDBM (2008), pp. 79\u201394"},{"key":"25_CR156","doi-asserted-by":"crossref","unstructured":"J.\u00a0Vaidya, Y.\u00a0Zhu, C.W. Clifton, Privacy Preserving Data Mining, vol.\u00a019. Advances in Information Security (Springer, Berlin, 2006)","DOI":"10.1109\/MSP.2004.108"},{"issue":"6","key":"25_CR157","first-page":"281","volume":"58","author":"E Eycken Van","year":"2000","unstructured":"E. Van Eycken, K. Haustermans, F. Buntinx et al., Evaluation of the encryption procedure and record linkage in the Belgian national cancer registry. Archiv. Public Health 58(6), 281\u2013294 (2000)","journal-title":"Archiv. Public Health"},{"key":"25_CR158","unstructured":"D. Vatsalan, P. Christen, An iterative two-party protocol for scalable privacy-preserving record linkage, in AusDM, CRPIT (2012), pp. 127\u2013138"},{"key":"25_CR159","unstructured":"D. Vatsalan, P. Christen, Sorted nearest neighborhood clustering for efficient private blocking, in Springer PAKDD, vol. 7819 (2013), pp. 341\u2013352"},{"key":"25_CR160","unstructured":"D.\u00a0Vatsalan, P.\u00a0Christen, Scalable privacy-preserving record linkage for multiple databases, in ACM CIKM (2014), pp. 1795\u20131798"},{"key":"25_CR161","first-page":"285","volume":"59","author":"D Vatsalan","year":"2016","unstructured":"D. Vatsalan, P. Christen, Privacy-preserving matching of similar patients. Elsevier JBI 59, 285\u2013298 (2016)","journal-title":"Elsevier JBI"},{"key":"25_CR162","unstructured":"D.\u00a0Vatsalan, P.\u00a0Christen, V.S. Verykios, An efficient two-party protocol for approximate matching in private record linkage, in AusDM (2011), pp. 125\u2013136"},{"key":"25_CR163","unstructured":"D.\u00a0Vatsalan, P.\u00a0Christen, V.S. Verykios, Efficient two-party private blocking based on sorted nearest neighborhood clustering, in ACM CIKM (2013), pp. 1949\u20131958"},{"key":"25_CR164","doi-asserted-by":"crossref","unstructured":"D. Vatsalan, P. Christen, V.S. Verykios, A taxonomy of privacy-preserving record linkage techniques. Elsevier JIS 38(6), 946\u2013969 (2013)","DOI":"10.1016\/j.is.2012.11.005"},{"key":"25_CR165","unstructured":"D.\u00a0Vatsalan, P.\u00a0Christen, C.M. O\u2019Keefe, V.S. Verykios, An evaluation framework for privacy-preserving record linkage. JPC 6(1), 3 (2014), pp. 35\u201375"},{"key":"25_CR166","unstructured":"R.\u00a0Vernica, M.J. Carey, C.\u00a0Li, Efficient parallel set-similarity joins using MapReduce, in ACM SIGMOD (2010), pp. 495\u2013506"},{"issue":"2","key":"25_CR167","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1504\/IJDMMM.2009.026076","volume":"1","author":"VS Verykios","year":"2009","unstructured":"V.S. Verykios, A. Karakasidis, V. Mitrogiannis, Privacy preserving record linkage approaches. IJDMMM 1(2), 206\u2013221 (2009)","journal-title":"IJDMMM"},{"issue":"3","key":"25_CR168","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/971617.971618","volume":"47","author":"G Wang","year":"2004","unstructured":"G. Wang, H. Chen, H. Atabakhsh, Automatically detecting deceptive criminal identities. Commun. ACM 47(3), 70\u201376 (2004)","journal-title":"Commun. ACM"},{"key":"25_CR169","unstructured":"Q.\u00a0Wang, D.\u00a0Vatsalan, P.\u00a0Christen, Efficient interactive training selection for large-scale entity resolution, in PAKDD (2015), pp. 562\u2013573"},{"key":"25_CR170","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Wen, C.\u00a0Dong, Efficient protocols for private record linkage, in ACM Symposium on Applied Computing (2014), pp. 1688\u20131694","DOI":"10.1145\/2554850.2555001"},{"issue":"7","key":"25_CR171","first-page":"531","volume":"29","author":"WE Winkler","year":"2004","unstructured":"W.E. Winkler, Methods for evaluating and creating data quality. Elsevier JIS 29(7), 531\u2013550 (2004)","journal-title":"Elsevier JIS"},{"key":"25_CR172","unstructured":"C.\u00a0Xiao, W.\u00a0Wang, X.\u00a0Lin, J.X. Yu, Efficient similarity joins for near duplicate detection, in WWW (2008), pp. 131\u2013140"},{"key":"25_CR173","unstructured":"M.\u00a0Yakout, M.\u00a0Atallah, A.\u00a0Elmagarmid, Efficient private record linkage, in IEEE ICDE (2009), pp. 1283\u20131286"},{"key":"25_CR174","doi-asserted-by":"crossref","unstructured":"P.\u00a0Zezula, G.\u00a0Amato, V.\u00a0Dohnal, M.\u00a0Batko, Similarity Search: The Metric Space Approach, vol.\u00a032 (Springer, Berlin, 2006)","DOI":"10.1007\/0-387-29151-2"},{"issue":"5","key":"25_CR175","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.jcss.2012.11.008","volume":"79","author":"X Zhang","year":"2013","unstructured":"X. Zhang, C. Liu, S. Nepal, J. Chen, An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud. J. Comput. Syst. Sci. 79(5), 542\u2013555 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"25_CR176","first-page":"1192","volume":"24","author":"X Zhang","year":"2013","unstructured":"X. Zhang, C. Liu, S. Nepal, S. Pandey, J. Chen, A privacy leakage upper bound constraint-based approach for cost-effective privacy preserving of intermediate data sets in cloud. IEEE TPDS 24(6), 1192\u20131202 (2013)","journal-title":"IEEE TPDS"}],"container-title":["Handbook of Big Data Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49340-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T07:02:57Z","timestamp":1692687777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49340-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319493398","9783319493404"],"references-count":176,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49340-4_25","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}