{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:02:36Z","timestamp":1765544556688,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319414829"},{"type":"electronic","value":"9783319414836"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-41483-6_5","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T11:09:11Z","timestamp":1467371351000},"page":"61-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Privacy Preserving Probabilistic Record Linkage Using Locality Sensitive Hashes"],"prefix":"10.1007","author":[{"given":"Ibrahim","family":"Lazrig","sequence":"first","affiliation":[]},{"given":"Toan","family":"Ong","sequence":"additional","affiliation":[]},{"given":"Indrajit","family":"Ray","sequence":"additional","affiliation":[]},{"given":"Indrakshi","family":"Ray","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,2]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Kerschbaum, F., Du, W.: Secure and private sequence comparisons. In: Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, WPES 2003, pp. 39\u201344. ACM, Washington, DC (2003)","DOI":"10.1145\/1005140.1005147"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45123-4_1","volume-title":"Combinatorial Pattern Matching","author":"A Broder","year":"2000","unstructured":"Broder, A.: Identifying and filtering near-duplicate documents. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 1\u201310. Springer, Heidelberg (2000)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E De Cristofaro","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143\u2013159. Springer, Heidelberg (2010)"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.inffus.2011.04.004","volume":"13","author":"E Durham","year":"2012","unstructured":"Durham, E., Xue, Y., Kantarcioglu, M., Malin, B.: Quantifying the correctness, computational complexity, and security of privacy-preserving string comparators for record linkage. Inf. Fusion 13(4), 245\u2013259 (2012)","journal-title":"Inf. Fusion"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/1159892.1159900","volume":"2","author":"J Feigenbaum","year":"2006","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M.J., Wright, R.N.: Secure multiparty computation of approximations. ACM Trans. Algorithms 2(3), 435\u2013472 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"328","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","volume":"64","author":"IP Fellegi","year":"1969","unstructured":"Fellegi, I.P., Sunter, A.B.: A theory for record linkage. J. Am. Stat. Assoc. 64(328), 1183\u20131210 (1969)","journal-title":"J. Am. Stat. Assoc."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2008","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155\u2013175. Springer, Heidelberg (2008)"},{"key":"5_CR9","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: Proceedings of the 19th Annual Network and Distributed System Security Symposium, San Diego, California, February 2012"},{"issue":"3","key":"5_CR10","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. J. Comput. Sci. Eng. 5(3), 223\u2013235 (2011)","journal-title":"J. Comput. Sci. Eng."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-20810-7_7","volume-title":"Data and Applications Security and Privacy XXIX","author":"I Lazrig","year":"2015","unstructured":"Lazrig, I., et al.: Privacy preserving record matching using automated semi-trusted broker. In: Samarati, P. (ed.) DBSec 2015. LNCS, vol. 9149, pp. 103\u2013118. Springer, Heidelberg (2015)"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.: Mining of Massive Datasets. Cambridge University Press, Cambridge (2014)"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"5_CR14","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-00179-6_5","volume-title":"Intelligent Patient Management","author":"C Pang","year":"2009","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. SCI, vol. 189, pp. 71\u201389. Springer, Heidelberg (2009)"},{"key":"5_CR15","unstructured":"Porter, E.H., Winkler, W.E., Census, B.O.T., Census, B.O.T.: Approximate String Comparison and Its Effect on an Advanced Record Linkage System. U.S. Bureau of the Census, Research report (1997)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Scannapieco, M., Figotin, I., Bertino, E., Elmagarmid, A.K.: Privacy preserving schema and data matching. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, SIGMOD 2007, pp. 653\u2013664. ACM, Beijing, China (2007)","DOI":"10.1145\/1247480.1247553"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12874-015-0038-6","volume":"15","author":"K Schmidlin","year":"2015","unstructured":"Schmidlin, K., Clough-Gorr, K.M., Spoerri, A.: Privacy preserving probabilistic record linkage (P3rl): a novel method for linking existing health-related data and maintaining participant confidentiality. BMC Med. Res. Methodol. 15(1), 1\u201310 (2015)","journal-title":"BMC Med. Res. Methodol."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1472-6947-9-41","volume":"9","author":"R Schnell","year":"2009","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: Privacy-preserving record linkage using bloom filters. BMC Med. Inform. Decis. Mak. 9(1), 1\u201311 (2009)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"5_CR19","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: An efficient two-party protocol for approximate matching in private record linkage. In: Proceedings of the Ninth Australasian Data Mining Conference, AusDM 2011, vol. 121, pp. 125\u2013136. Australian Computer Society, Darlinghurst, Australia (2011)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Yakout, M., Atallah, M.J., Elmagarmid, A.: Efficient private record linkage. In: Proceedings of the 25th IEEE International Conference on Data Engineering, ICDE 2009, pp. 1283\u20131286, March 2009","DOI":"10.1109\/ICDE.2009.221"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41483-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T11:18:08Z","timestamp":1595935088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41483-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319414829","9783319414836"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41483-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}