{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:59:48Z","timestamp":1764403188708,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031168147"},{"type":"electronic","value":"9783031168154"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16815-4_22","type":"book-chapter","created":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T20:19:35Z","timestamp":1663964375000},"page":"398-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Privacy-Preserving Record Linkage Using Local Sensitive Hash and\u00a0Private Set Intersection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8128-6706","authenticated-orcid":false,"given":"Allon","family":"Adir","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3647-1440","authenticated-orcid":false,"given":"Ehud","family":"Aharoni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7273-4797","authenticated-orcid":false,"given":"Nir","family":"Drucker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6123-0297","authenticated-orcid":false,"given":"Eyal","family":"Kushnir","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6808-5675","authenticated-orcid":false,"given":"Ramy","family":"Masalha","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7332-7667","authenticated-orcid":false,"given":"Michael","family":"Mirkin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7570-4366","authenticated-orcid":false,"given":"Omri","family":"Soceanu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,24]]},"reference":[{"issue":"4","key":"22_CR1","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1109\/TCBB.2018.2855125","volume":"16","author":"DB Baker","year":"2019","unstructured":"Baker, D.B., et al.: Privacy-preserving linkage of genomic and clinical data sets. IEEE\/ACM Trans. Comput. Biol. Bioinf. 16(4), 1342\u20131348 (2019). https:\/\/doi.org\/10.1109\/TCBB.2018.2855125","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Barker, E., Chen, L., Moody, D.: Recommendation for Pair-Wise Key-Establishment Schemes Using Integer Factorization Cryptography (Revision 1) (2014). https:\/\/doi.org\/10.6028\/NIST.SP.800-56Br1","DOI":"10.6028\/NIST.SP.800-56Br1"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"JL Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MIC.2018.112102542","volume":"22","author":"F Chen","year":"2018","unstructured":"Chen, F., et al.: Perfectly secure and efficient two-party electronic-health-record linkage. IEEE Internet Comput. 22(2), 32\u201341 (2018). https:\/\/doi.org\/10.1109\/MIC.2018.112102542","journal-title":"IEEE Internet Comput."},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 1223\u20131237. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 1243\u20131255. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3134061","DOI":"10.1145\/3133956.3134061"},{"key":"22_CR7","unstructured":"Chen, Y.: Current approaches and challenges for the two-party privacy-preserving record linkage (PPRL). In: Collaborative Technologies and Data Science in Artificial Intelligence Applications, pp. 108\u2013116 (2020). https:\/\/codassca2020.aua.am\/wp-content\/uploads\/2020\/09\/2020_Codassca_Chen.pdf"},{"issue":"11","key":"22_CR8","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1109\/TKDE.2018.2874004","volume":"31","author":"P Christen","year":"2019","unstructured":"Christen, P., Ranbaduge, T., Vatsalan, D., Schnell, R.: Precise and fast cryptanalysis for bloom filter based privacy-preserving record linkage. IEEE Trans. Knowl. Data Eng. 31(11), 2164\u20132177 (2019). https:\/\/doi.org\/10.1109\/TKDE.2018.2874004","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-319-57454-7_49","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P Christen","year":"2017","unstructured":"Christen, P., Schnell, R., Vatsalan, D., Ranbaduge, T.: Efficient cryptanalysis of bloom filters for privacy-preserving record linkage. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10234, pp. 628\u2013640. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_49"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-24775-3_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T Churches","year":"2004","unstructured":"Churches, T., Christen, P.: Blind data linkage using n-gram similarity comparisons. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 121\u2013126. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24775-3_15"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Clifton, C., et al.: Privacy-preserving data integration and sharing. In: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD 2004, pp. 19\u201326. Association for Computing Machinery, New York (2004). https:\/\/doi.org\/10.1145\/1008694.1008698","DOI":"10.1145\/1008694.1008698"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Cong, K., et al.: Labeled PSI from homomorphic encryption with reduced computation and communication. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS 2021, pp. 1135\u20131150. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"22_CR13","unstructured":"Cui, H., Yu, Y.: A Not-So-Trival Replay Attack Against DH-PSI. Cryptology ePrint Archive, Report 2020\/901 (2020). https:\/\/ia.cr\/2020\/901"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Essex, A.: Secure approximate string matching for privacy-preserving record linkage. IEEE Trans. Inf. Forensics Secur. 14(10) (2019). https:\/\/doi.org\/10.1109\/TIFS.2019.2903651","DOI":"10.1109\/TIFS.2019.2903651"},{"key":"22_CR15","unstructured":"Franke, M., Rahm, E.: Evaluation of Hardening Techniques for Privacy-Preserving Record Linkage (2021)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Franke, M., Sehili, Z., Rahm, E.: Parallel privacy-preserving record linkage using LSH-based blocking. In: International Conference on Internet of Things, Big Data and Security (IoTBDS) (2018). https:\/\/www.scitepress.org\/Papers\/2018\/66827\/66827.pdf","DOI":"10.5220\/0006682701950203"},{"key":"22_CR17","unstructured":"Freeman, D.: Pairing-based identification schemes. Cryptology ePrint Archive, Report 2005\/336 (2005). https:\/\/ia.cr\/2005\/336"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"4966","DOI":"10.1109\/TIFS.2021.3114026","volume":"16","author":"A Gkoulalas-Divanis","year":"2021","unstructured":"Gkoulalas-Divanis, A., Vatsalan, D., Karapiperis, D., Kantarcioglu, M.: Modern privacy-preserving record linkage techniques: an overview. IEEE Trans. Inf. Forensics Secur. 16, 4966\u20134987 (2021). https:\/\/doi.org\/10.1109\/TIFS.2021.3114026","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"22_CR19","unstructured":"Gyawali, B., Anastasiou, L., Knoth, P.: Deduplication of scholarly documents using locality sensitive hashing and word embeddings. In: Proceedings of The 12th Language Resources and Evaluation Conference, Marseille, France, pp. 894\u2013903. European Language Resources Association (2020). https:\/\/oro.open.ac.uk\/70519\/"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"He, X., Machanavajjhala, A., Flynn, C., Srivastava, D.: Composing differential privacy and secure computation: a case study on scaling private record linkage. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 1389\u20131406. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3134030","DOI":"10.1145\/3133956.3134030"},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: Proceedings of the 1st ACM Conference on Electronic Commerce, EC 19999, pp. 78\u201386. Association for Computing Machinery (1999). https:\/\/doi.org\/10.1145\/336992.337012","DOI":"10.1145\/336992.337012"},{"key":"22_CR22","unstructured":"IBM: IBM InfoSphere\u00ae Optim\u2122 Test Data Fabrication (2022). https:\/\/www.ibm.com\/products\/infosphere-optim-test-data-fabrication"},{"key":"22_CR23","unstructured":"IBM Research: Helayers (2022). https:\/\/hub.docker.com\/r\/ibmcom\/helayers-pylab"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Ioffe, S.: Improved consistent sampling, weighted MinHash and L1 sketching. In: 2010 IEEE International Conference on Data Mining, pp. 246\u2013255 (2010)","DOI":"10.1109\/ICDM.2010.80"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TKDE.2017.2761759","volume":"30","author":"D Karapiperis","year":"2018","unstructured":"Karapiperis, D., Gkoulalas-Divanis, A., Verykios, V.S.: FEDERAL: a framework for distance-aware privacy-preserving record linkage. IEEE Trans. Knowl. Data Eng. 30(2), 292\u2013304 (2018). https:\/\/doi.org\/10.1109\/TKDE.2017.2761759","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"22_CR26","doi-asserted-by":"publisher","first-page":"745","DOI":"10.2298\/CSIS140215040K","volume":"11","author":"D Karapiperis","year":"2014","unstructured":"Karapiperis, D., Verykios, V.S.: A distributed near-optimal LSH-based framework for privacy-preserving record linkage. Comput. Sci. Inf. Syst. 11(2), 745\u2013763 (2014). https:\/\/doi.org\/10.2298\/CSIS140215040K","journal-title":"Comput. Sci. Inf. Syst."},{"issue":"4","key":"22_CR27","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10115-004-0173-6","volume":"7","author":"H Kargupta","year":"2005","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: Random-data perturbation techniques and privacy-preserving data mining. Knowl. Inf. Syst. 7(4), 387\u2013414 (2005). https:\/\/doi.org\/10.1007\/s10115-004-0173-6","journal-title":"Knowl. Inf. Syst."},{"key":"22_CR28","doi-asserted-by":"publisher","unstructured":"Khurram, B., Kerschbaum, F.: SFour: a protocol for cryptographically secure record linkage at scale. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 277\u2013288 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00031","DOI":"10.1109\/ICDE48307.2020.00031"},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Kroll, M., Steinmetzer, S.: Automated cryptanalysis of bloom filter encryptions of health records. In: Proceedings of the International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2015, vol. 5, pp. 5\u201313. SCITEPRESS - Science and Technology Publications, Lda, Setubal, PRT (2015). https:\/\/doi.org\/10.5220\/0005176000050013","DOI":"10.5220\/0005176000050013"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-22263-4_13","volume-title":"Privacy Enhancing Technologies","author":"M Kuzu","year":"2011","unstructured":"Kuzu, M., Kantarcioglu, M., Durham, E., Malin, B.: A constraint satisfaction cryptanalysis of bloom filters in private record linkage. In: Fischer-H\u00fcbner, S., Hopper, N. (eds.) PETS 2011. LNCS, vol. 6794, pp. 226\u2013245. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22263-4_13"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Finding similar items. In: Mining of Massive Datasets, pp. 73\u2013130 (2014). https:\/\/infolab.stanford.edu\/~ullman\/mmds\/ch3a.pdf","DOI":"10.1017\/CBO9781139924801"},{"key":"22_CR32","doi-asserted-by":"publisher","unstructured":"Li, Y., Xia, K.: Fast video deduplication via locality sensitive hashing with similarity ranking. In: Proceedings of the International Conference on Internet Multimedia Computing and Service, ICIMCS 2016, pp. 94\u201398. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/3007669.3007725","DOI":"10.1145\/3007669.3007725"},{"key":"22_CR33","doi-asserted-by":"publisher","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: 1986 IEEE Symposium on Security and Privacy, p. 134 (1986). https:\/\/doi.org\/10.1109\/SP.1986.10022","DOI":"10.1109\/SP.1986.10022"},{"key":"22_CR34","doi-asserted-by":"publisher","unstructured":"Mullaymeri, X., Karakasidis, A.: A two-party private string matching fuzzy vault scheme. In: Proceedings of the 36th Annual ACM Symposium on Applied Computing, pp. 340\u2013343. Association for Computing Machinery (2021). https:\/\/doi.org\/10.1145\/3412841.3442079","DOI":"10.1145\/3412841.3442079"},{"key":"22_CR35","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: 23rd USENIX Security Symposium (USENIX Security 2014), San Diego, CA, pp. 797\u2013812. USENIX Association (2014). https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/pinkas"},{"key":"22_CR36","doi-asserted-by":"publisher","unstructured":"Rao, F.Y., Cao, J., Bertino, E., Kantarcioglu, M.: Hybrid private record linkage: separating differentially private synopses from matching records. ACM Trans. Priv. Secur. 22(3) (2019). https:\/\/doi.org\/10.1145\/3318462","DOI":"10.1145\/3318462"},{"key":"22_CR37","unstructured":"Ravikumar, P., Cohen, W.W., Fienberg, S.E.: A secure protocol for computing string distance metrics. PSDM held at ICDM (2004). https:\/\/www.cs.cmu.edu\/afs\/cs.cmu.edu\/Web\/People\/wcohen\/postscript\/psdm-2004.pdf"},{"issue":"January","key":"22_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2018.02.006","volume":"108","author":"A Saleem","year":"2018","unstructured":"Saleem, A., Khan, A., Shahid, F., Masoom Alam, M., Khan, M.K.: Recent advancements in garbled computing: how far have we come towards achieving secure, efficient and reusable garbled circuits. J. Netw. Comput. Appl. 108(January), 1\u201319 (2018). https:\/\/doi.org\/10.1016\/j.jnca.2018.02.006","journal-title":"J. Netw. Comput. Appl."},{"issue":"1","key":"22_CR39","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.: Privacy-preserving record linkage using Bloom filters. BMC Med. Inform. Decis. Mak. 9(1), 41 (2009). https:\/\/doi.org\/10.1186\/1472-6947-9-41","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"22_CR40","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"},{"issue":"9","key":"22_CR41","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1016\/j.camwa.2012.02.028","volume":"65","author":"KSS Wong","year":"2013","unstructured":"Wong, K.S.S., Kim, M.H.: Privacy-preserving similarity coefficients for binary data. Comput. Math. Appl. 65(9), 1280\u20131290 (2013). https:\/\/doi.org\/10.1016\/j.camwa.2012.02.028","journal-title":"Comput. Math. Appl."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16815-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T13:09:08Z","timestamp":1742044148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16815-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031168147","9783031168154"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16815-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/acns2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}