{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:37:41Z","timestamp":1743075461298,"version":"3.40.3"},"publisher-location":"Cham","reference-count":80,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030197582"},{"type":"electronic","value":"9783030197599"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19759-9_8","type":"book-chapter","created":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:47:10Z","timestamp":1556351230000},"page":"118-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Overview of Big Data Issues in Privacy-Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Dinusha","family":"Vatsalan","sequence":"first","affiliation":[]},{"given":"Dimitrios","family":"Karapiperis","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Gkoulalas-Divanis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Al-Lawati, A., Lee, D., McDaniel, P.: Blocking-aware private record linkage. In: IQIS, pp. 59\u201368 (2005)","DOI":"10.1145\/1077501.1077513"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptology 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptology"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bachteler, T., Reiher, J., Schnell, R.: Similarity Filtering with Multibit Trees for Record Linkage. Tech. Rep. WP-GRLC-2013-01, German Record Linkage Center (2013)","DOI":"10.2139\/ssrn.3530899"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Barros, J.E., French, J.C., Martin, W.N., Kelly, P.M., Cannon, T.M.: Using the triangle inequality to reduce the number of comparisons required for similarity-based retrieval. In: Electronic Imaging: Science & Technology, pp. 392\u2013403 (1996)","DOI":"10.1117\/12.234778"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW, Canada, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"8_CR6","unstructured":"Berman, A., Shapiro, L.G.: Selecting good keys for triangle-inequality-based pruning algorithms. In: IEEE Workshop on Content-Based Access of Image and Video Database, pp. 12\u201319 (1998)"},{"key":"8_CR7","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences, pp. 21\u201329. IEEE (1997)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1111\/j.1753-6405.2008.00160.x","volume":"32","author":"E Brook","year":"2008","unstructured":"Brook, E., Rosman, D., Holman, C.: 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":"8_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Christen, P.: Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Data-Centric Systems and Application. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2","DOI":"10.1007\/978-3-642-31164-2"},{"issue":"9","key":"8_CR11","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"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Christen, P., Gayler, R., Hawking, D.: Similarity-aware indexing for real-time entity resolution. In: ACM CIKM, Hong Kong, pp. 1565\u20131568 (2009)","DOI":"10.1145\/1645953.1646173"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-01307-2_47","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Christen","year":"2009","unstructured":"Christen, P., Pudjijono, A.: Accurate synthetic generation of realistic personal information. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 507\u2013514. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01307-2_47"},{"key":"8_CR14","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, Edmonton, pp. 475\u2013480 (2002)","DOI":"10.1145\/775047.775116"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Dal Bianco, G., Galante, R., Heuser, C.A.: A fast approach for parallel deduplication on multicore processors. In: ACM Symposium on Applied Computing, pp. 1027\u20131032 (2011)","DOI":"10.1145\/1982185.1982411"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/TKDE.2010.134","volume":"23","author":"D Dey","year":"2010","unstructured":"Dey, D., Mookerjee, V., Liu, D.: Efficient techniques for online record linkage. IEEE Trans. Knowl. Data Engin. 23(3), 373\u2013387 (2010)","journal-title":"IEEE Trans. Knowl. Data Engin."},{"key":"8_CR17","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":"8_CR18","unstructured":"Elliot, M., Hundepool, A., Nordholt, E., Tambay, J., Wende, T.: Glossary on statistical disclosure control. In: Joint UNECE\/Eurostat Work Session on Statistical Data Confidentiality (2005)"},{"key":"8_CR19","unstructured":"Forchhammer, B., Papenbrock, T., Stening, T., Viehmeier, S., Draisbach, U., Naumann, F.: Duplicate Detection on GPUs. In: Database Systems for Business, Technology, and Web, pp. 165\u2013184 (2013)"},{"key":"8_CR20","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB, pp. 518\u2013529 (1999)"},{"key":"8_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Hall, R., Fienberg, S.: Privacy-preserving record linkage. In: PSD, Corfu, Greece, pp. 269\u2013283 (2010)","DOI":"10.1007\/978-3-642-15838-4_24"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0024-6301(96)00095-7","volume":"30","author":"T Hill","year":"1997","unstructured":"Hill, T., Westbrook, R.: Swot analysis: it\u2019s time for a product recall. Long Range Plann. 30(1), 46\u201352 (1997)","journal-title":"Long Range Plann."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1276301.1276305","volume":"36","author":"J Hoag","year":"2007","unstructured":"Hoag, J., Thompson, C.: A parallel general-purpose synthetic data generator. ACM SIGMOD 36, 19\u201324 (2007)","journal-title":"ACM SIGMOD"},{"key":"8_CR25","unstructured":"Hundepool, A., et al.: Handbook on statistical disclosure control. A Network of Excellence in the European Statistical System in the field of Statistical Disclosure Control (2010)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Inan, A., Kantarcioglu, M., Bertino, E., Scannapieco, M.: A hybrid approach to private record linkage. In: IEEE ICDE, Cancun, Mexico, pp. 496\u2013505 (2008)","DOI":"10.1109\/ICDE.2008.4497458"},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.datak.2007.06.014","volume":"65","author":"W Jiang","year":"2008","unstructured":"Jiang, W., Clifton, C., Kantarc\u0131o\u011flu, M.: Transforming semi-honest protocols to ensure accountability. Data Knowl. Eng. 65(1), 57\u201374 (2008)","journal-title":"Data Knowl. Eng."},{"key":"8_CR28","unstructured":"Jonas, J., Harper, J.: Effective counterterrorism and the limited role of predictive data mining. Policy Anal. 584 (2006)"},{"key":"8_CR29","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.S.: Secure blocking+secure matching = secure record linkage. JCSE 5, 223\u2013235 (2011)","journal-title":"JCSE"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Karakasidis, A., Verykios, V.S.: Reference table based k-anonymous private blocking. In: ACM SAC, Riva del Garda, pp. 859\u2013864 (2012)","DOI":"10.1145\/2245276.2245444"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-28879-1_2","volume-title":"Data Privacy Management and Autonomous Spontaneus Security","author":"A Karakasidis","year":"2012","unstructured":"Karakasidis, A., Verykios, V.S., Christen, P.: Fakling. In: Garcia-Alfaro, J., Navarro-Arribas, G., Cuppens-Boulahia, N., de Capitani di Vimercati, S. (eds.) DPM\/SETOP -2011. LNCS, vol. 7122, pp. 9\u201324. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28879-1_2"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Karakasidis, A., Koloniari, G., Verykios, V.S.: Scalable blocking for privacy preserving record linkage. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 527\u2013536. ACM (2015)","DOI":"10.1145\/2783258.2783290"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Karapiperis, D., Gkoulalas-Divanis, A., Verykios, V.: LSHDB: a parallel and distributed engine for record linkage and similarity search. In: ICDM Demo, pp. 1\u20134 (2016)","DOI":"10.1109\/ICDMW.2016.7867099"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Karapiperis, D., Gkoulalas-Divanis, A., Verykios, V.: Distance-aware encoding of numerical values for privacy-preserving record linkage. In: ICDE, pp. 135\u2013138 (2017)","DOI":"10.1109\/ICDE.2017.58"},{"issue":"4","key":"8_CR35","first-page":"909","volume":"27","author":"D Karapiperis","year":"2015","unstructured":"Karapiperis, D., Verykios, V.: An LSH-based blocking approach with a homomorphic matching technique for privacy-preserving record linkage. TKDE 27(4), 909\u2013921 (2015)","journal-title":"TKDE"},{"issue":"2","key":"8_CR36","first-page":"292","volume":"30","author":"D Karapiperis","year":"2018","unstructured":"Karapiperis, D., Verykios, V.: FEDERAL: a framework for distance-aware privacy-preserving record linkage. TKDE 30(2), 292\u2013304 (2018)","journal-title":"TKDE"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Karapiperis, D., Verykios, V.S.: A distributed framework for scaling up lsh-based computations in privacy preserving record linkage. In: ACM BCI, pp. 102\u2013109 (2013)","DOI":"10.1145\/2490257.2490258"},{"issue":"3","key":"8_CR38","first-page":"1","volume":"49","author":"D Karapiperis","year":"2016","unstructured":"Karapiperis, D., Verykios, V.S.: A fast and efficient hamming LSH-based scheme for accurate linkage. KAIS 49(3), 1\u201324 (2016)","journal-title":"KAIS"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Kim, H., Lee, D.: Harra: fast iterative hashed record linkage for large-scale data collections. In: EDBT, Lausanne, Switzerland, pp. 525\u2013536 (2010)","DOI":"10.1145\/1739041.1739104"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Kim, H., Lee, D.: Parallel linkage. In: ACM CIKM, pp. 283\u2013292 (2007)","DOI":"10.1145\/1321440.1321482"},{"key":"8_CR41","unstructured":"Kirsten, T., Kolb, L., Hartung, M., Gro\u00df, A., K\u00f6pcke, H., Rahm, E.: Data partitioning for parallel entity matching. VLDB 3(2) (2010)"},{"issue":"12","key":"8_CR42","first-page":"1878","volume":"5","author":"L Kolb","year":"2012","unstructured":"Kolb, L., Thor, A., Rahm, E.: Dedoop: efficient deduplication with hadoop. VLDB 5(12), 1878\u20131881 (2012)","journal-title":"VLDB"},{"issue":"1","key":"8_CR43","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. Algorithms Mol. Biol. 5(1), 9 (2010)","journal-title":"Algorithms Mol. Biol."},{"key":"8_CR44","unstructured":"Lai, P., Yiu, S., Chow, K., Chong, C., Hui, L.: An efficient Bloom filter based solution for multiparty private matching. In: International Conference on Security and Management, p. 7 (2006)"},{"key":"8_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52\u201378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_4"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. JPC 1(1) (2009)","DOI":"10.29012\/jpc.v1i1.566"},{"key":"8_CR47","unstructured":"Lu, H., Shan, M.C., Tan, K.L.: Optimization of multi-way join queries for parallel execution. In: VLDB, pp. 549\u2013560 (1991)"},{"issue":"1","key":"8_CR48","first-page":"2","volume":"20","author":"BA Malin","year":"2013","unstructured":"Malin, B.A., El Emam, K., O\u2019Keefe, C.M.: Biomedical data privacy: problems, perspectives, and recent advances. JAMIA 20(1), 2\u20136 (2013)","journal-title":"JAMIA"},{"key":"8_CR49","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)"},{"key":"8_CR50","doi-asserted-by":"publisher","unstructured":"Pang, C., Gu, L., Hansen, D., Maeder, A.: Privacy-preserving fuzzy matching using a public reference table. In: McClean, S., Millard, P., El-Darzi, E., Nugent, C. (eds.) Intelligent Patient Management. Studies in Computational Intelligence, vol. 189, pp. 71\u201389. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00179-6_5","DOI":"10.1007\/978-3-642-00179-6_5"},{"issue":"12","key":"8_CR51","doi-asserted-by":"publisher","first-page":"2665","DOI":"10.1109\/TKDE.2012.150","volume":"25","author":"G Papadakis","year":"2013","unstructured":"Papadakis, G., Ioannou, E., Palpanas, T., Niederee, C., Nejdl, W.: A blocking framework for entity resolution in highly heterogeneous information spaces. IEEE Trans. Knowl. Data Eng. 25(12), 2665\u20132682 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"14","key":"8_CR52","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.14778\/2733085.2733098","volume":"7","author":"G Papadakis","year":"2014","unstructured":"Papadakis, G., Papastefanatos, G., Koutrika, G.: Supervised meta-blocking. Proc. VLDB Endowment 7(14), 1929\u20131940 (2014)","journal-title":"Proc. VLDB Endowment"},{"key":"8_CR53","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"2003","unstructured":"Papadimitriou, C.: Computational Complexity. Wiley, Hoboken (2003)"},{"key":"8_CR54","unstructured":"Peng, G.C.A., Nunes, M.B.: Using pest analysis as a tool for refining and focusing contexts for information systems research. In: Research Methodology for Business and Management Studies, Lisbon, Portugal, pp. 229\u2013236 (2007)"},{"issue":"3","key":"8_CR55","first-page":"533","volume":"24","author":"C Phua","year":"2012","unstructured":"Phua, C., Smith-Miles, K., Lee, V., Gayler, R.: Resilient identity crime detection. IEEE TKDE 24(3), 533\u2013546 (2012)","journal-title":"IEEE TKDE"},{"key":"8_CR56","doi-asserted-by":"crossref","unstructured":"Ranbaduge, T., Christen, P., Vatsalan, D.: Tree based scalable indexing for multi-party privacy-preserving record linkage. In: AusDM (2014)","DOI":"10.1109\/ICDMW.2015.101"},{"key":"8_CR57","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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":"T Ranbaduge","year":"2015","unstructured":"Ranbaduge, T., Vatsalan, D., Christen, P.: Clustering-based scalable indexing for multi-party privacy-preserving record linkage. In: Cao, T., Lim, E.-P., Zhou, Z.-H., Ho, T.-B., Cheung, D., Motoda, H. (eds.) PAKDD 2015. LNCS (LNAI), vol. 9078, pp. 549\u2013561. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18032-8_43"},{"key":"8_CR58","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). https:\/\/doi.org\/10.1007\/978-3-319-31750-2_33"},{"key":"8_CR59","doi-asserted-by":"crossref","unstructured":"Ranbaduge, T., Vatsalan, D., Christen, P.: Scalable block scheduling for efficient multi-database record linkage. In: ICDM. Barcelona (2016)","DOI":"10.1109\/ICDM.2016.0153"},{"key":"8_CR60","first-page":"205","volume":"50","author":"SM Randall","year":"2014","unstructured":"Randall, S.M., Ferrante, A.M., Boyd, J.H., Semmens, J.B.: Privacy-preserving record linkage on large real world datasets. JBI 50, 205\u2013212 (2014)","journal-title":"JBI"},{"key":"8_CR61","unstructured":"Schneider, D.A., DeWitt, D.J.: Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In: VLDB, pp. 469\u2013480 (1990)"},{"issue":"3","key":"8_CR62","first-page":"263","volume":"30","author":"R Schnell","year":"2014","unstructured":"Schnell, R.: 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"},{"key":"8_CR63","unstructured":"Sehili, Z., Kolb, L., Borgs, C., Schnell, R., Rahm, E.: Privacy preserving record linkage with PPJoin. In: BTW Conference, Hamburg (2015)"},{"key":"8_CR64","volume-title":"The Mathematical Theory of Communication","author":"C Shannon","year":"1962","unstructured":"Shannon, C., Weaver, W.: The Mathematical Theory of Communication, vol. 19. University of Illinois Press, Urbana (1962)"},{"key":"8_CR65","unstructured":"Sweeney, L.: Computational disclosure control: A Primer on Data Privacy Protection. Ph.D. thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science (2001)"},{"key":"8_CR66","doi-asserted-by":"crossref","unstructured":"Tran, K.N., Vatsalan, D., Christen, P.: GeCo: an online personal data generator and corruptor. In: ACM CIKM, San Francisco, pp. 2473\u20132476 (2013)","DOI":"10.1145\/2505515.2508207"},{"key":"8_CR67","unstructured":"Vatsalan, D., Christen, P.: An iterative two-party protocol for scalable privacy-preserving record linkage. In: AusDM, CRPIT, vol. 134, Sydney (2012)"},{"key":"8_CR68","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: An efficient two-party protocol for approximate matching in private record linkage. In: AusDM, Ballarat (2011)"},{"issue":"6","key":"8_CR69","first-page":"946","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: A taxonomy of privacy-preserving record linkage techniques. JIS 38(6), 946\u2013969 (2013)","journal-title":"JIS"},{"key":"8_CR70","unstructured":"Vatsalan, D.: Scalable and approximate privacy-preserving record linkage. Ph.D. thesis, Research School of Computer Science, The Australian National University (2014)"},{"key":"8_CR71","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-37456-2_29","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P.: Sorted nearest neighborhood clustering for efficient private blocking. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7819, pp. 341\u2013352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37456-2_29"},{"key":"8_CR72","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":"8_CR73","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., O\u2019Keefe, C.M., Verykios, V.S.: An evaluation framework for privacy-preserving record linkage. JPC (2014)","DOI":"10.29012\/jpc.v6i1.636"},{"key":"8_CR74","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Rahm, E.: Scalable privacy-preserving linking of multiple databases using counting bloom filters. In: IEEE ICDMW, Barcelona, Spain (2016)","DOI":"10.1109\/ICDMW.2016.0130"},{"key":"8_CR75","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: Efficient two-party private blocking based on sorted nearest neighborhood clustering. In: ACM CIKM, San Francisco, pp. 1949\u20131958 (2013)","DOI":"10.1145\/2505515.2505757"},{"key":"8_CR76","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"},{"key":"8_CR77","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: Proceedings of ACM SIGMOD, pp. 495\u2013506 (2010)","DOI":"10.1145\/1807167.1807222"},{"issue":"3","key":"8_CR78","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/971617.971618","volume":"47","author":"G Wang","year":"2004","unstructured":"Wang, G., Chen, H., Atabakhsh, H.: Automatically detecting deceptive criminal identities. Commun. ACM 47(3), 70\u201376 (2004)","journal-title":"Commun. ACM"},{"key":"8_CR79","doi-asserted-by":"crossref","unstructured":"Whang, S.E., Menestrina, D., Koutrika, G., Theobald, M., Garcia-Molina, H.: Entity resolution with iterative blocking. In: ACM SIGMOD, Providence, Rhode Island, pp. 219\u2013232 (2009)","DOI":"10.1145\/1559845.1559870"},{"key":"8_CR80","doi-asserted-by":"publisher","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach, vol. 32. Springer, New York (2006). https:\/\/doi.org\/10.1007\/0-387-29151-2","DOI":"10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19759-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T06:32:33Z","timestamp":1607409153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19759-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030197582","9783030197599"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19759-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","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":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/algocloud\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}