{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T14:06:14Z","timestamp":1746626774149,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2012CB316201"],"award-info":[{"award-number":["2012CB316201"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472070","61672142"],"award-info":[{"award-number":["61472070","61672142"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1435216","61602103"],"award-info":[{"award-number":["U1435216","61602103"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10586-022-03590-7","type":"journal-article","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T09:18:26Z","timestamp":1650619106000},"page":"3641-3652","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An enhanced privacy-preserving record linkage approach for multiple databases"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5602-9863","authenticated-orcid":false,"given":"Shumin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiezheng","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Kou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,22]]},"reference":[{"key":"3590_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching: Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Berlin (2012)"},{"key":"3590_CR2","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Karapiperis, D., Verykios, V S.: Privacy-preserving record linkage. In: Encyclopedia of Big Data Technologies. Springer, Cham (2019)","DOI":"10.1007\/978-3-319-77525-8_17"},{"issue":"July","key":"3590_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.future.2019.01.012","volume":"96","author":"X Xu","year":"2019","unstructured":"Xu, X., Xue, Y., Qi, L., et al.: An edge computing-enabled computation offloading method with privacy preservation for internet of connected vehicles. Future Gener. Comput. Syst. 96(July), 89\u2013100 (2019)","journal-title":"Future Gener. Comput. Syst."},{"key":"3590_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2019.11.021","volume":"515","author":"L Qi","year":"2019","unstructured":"Qi, L., Zhang, X., Li, S., et al.: Spatial\u2013temporal data-driven service recommendation with privacy-preservation. Inf. Sci. 515, 91\u2013102 (2019)","journal-title":"Inf. Sci."},{"issue":"6","key":"3590_CR5","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: A taxonomy of privacy-preserving record linkage techniques. Inf. Syst. 38(6), 946\u2013969 (2013)","journal-title":"Inf. Syst."},{"key":"3590_CR6","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Sehili, Z., Christen, P., Rahm, E.: Privacy-preserving record linkage for big data: current approaches and research challenges. In: Handbook of Big Data Technologies, pp. 851\u2013895. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-49340-4_25"},{"key":"3590_CR7","doi-asserted-by":"publisher","first-page":"101826","DOI":"10.1016\/j.is.2021.101826","volume":"102","author":"T N\u00f3brega","year":"2021","unstructured":"N\u00f3brega, T., Pires, C., Nascimento, D.C.: Blockchain-based privacy-preserving record linkage enhancing data privacy in an untrusted environment. Inf. Syst. 102, 101826 (2021)","journal-title":"Inf. Syst."},{"issue":"1","key":"3590_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1186\/s12967-020-02678-1","volume":"19","author":"F Rohde","year":"2021","unstructured":"Rohde, F., Franke, M., Sehili, Z., et al.: Optimization of the Mainzelliste software for fast privacy-preserving record linkage. J. Transl. Med. 19(1), 33 (2021)","journal-title":"J. Transl. Med."},{"key":"3590_CR9","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M., Wei, J., Malin, B.: A privacy-preserving framework for integrating person-specific databases. In: UNESCO Chair in Data Privacy International Conference on Privacy in Statistical Databases, pp. 298\u2013314 (2008)","DOI":"10.1007\/978-3-540-87471-3_25"},{"key":"3590_CR10","doi-asserted-by":"crossref","unstructured":"Christine, M.O., Yung, M., Gu, L.F., Rohan, B.: Privacy-preserving data linkage protocols. In: Proceedings of ACM Workshop on Privacy in the Electronic Society, pp. 94\u2013102 (2004)","DOI":"10.1145\/1029179.1029203"},{"key":"3590_CR11","unstructured":"Lai, P.K.Y., Yiu, S.M., Chow, K.P., Chong, C.F., Hui, L.C.K.: An efficient bloom filter based solution for multi-party private matching. In: Proceedings of the 2006 International Conference on Security and Management, 2006, pp. 286\u2013292 (2006)"},{"key":"3590_CR12","doi-asserted-by":"crossref","unstructured":"Karapiperis, D., Vatsalan, D., Verykios, V.S., Christen, P.: Large-scale multi-party counting set intersection using a space efficient global synopsis. In: International Conference on Database Systems for Advanced Applications, pp. 329\u2013345 (2015)","DOI":"10.1007\/978-3-319-18123-3_20"},{"key":"3590_CR13","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P.: Scalable privacy-preserving record linkage for multiple databases. In: Proceedings of the 23rd ACM International Conference on Information and Knowledge Management, pp. 1795\u20131798 (2014)","DOI":"10.1145\/2661829.2661875"},{"key":"3590_CR14","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Rahm, E.: Scalable privacy-preserving linking of multiple databases using counting bloom filters. In: IEEE 16th International Conference on Data Mining Workshops, pp. 882\u2013889 (2016)","DOI":"10.1109\/ICDMW.2016.0130"},{"issue":"1","key":"3590_CR15","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)","journal-title":"BMC Med. Inform. Decis. Mak."},{"issue":"3","key":"3590_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1080\/09332480.2004.10554910","volume":"17","author":"AF Karr","year":"2004","unstructured":"Karr, A.F., Lin, X.D., Sanil, A.P., Reiter, J.P.: Analysis of integrated data without data integration. Chance 17(3), 26\u201329 (2004)","journal-title":"Chance"},{"key":"3590_CR17","doi-asserted-by":"crossref","unstructured":"Christen, P., Vidanage, A., Ranbaduge, T.: Pattern-mining based cryptanalysis of bloom filters for privacy-preserving record linkage. In: Pacific\u2013Asia Conference on Knowledge Discovery and Data Mining, pp. 530\u2013542 (2018)","DOI":"10.1007\/978-3-319-93040-4_42"},{"key":"3590_CR18","doi-asserted-by":"crossref","unstructured":"Vidanage, A., Ranbaduge, T., Christen P., Schnell R.: Efficient pattern mining based cryptanalysis for privacy-preserving record linkage. In: IEEE 35th International Conference on Data Engineering, 2019, pp. 1698\u20131701 (2019)","DOI":"10.1109\/ICDE.2019.00176"},{"issue":"1","key":"3590_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E Malaguti","year":"2010","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. Int. Trans. Oper. Res. 17(1), 1\u201334 (2010)","journal-title":"Int. Trans. Oper. Res."},{"key":"3590_CR20","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P.: Sorted nearest neighborhood clustering for efficient private blocking. In: Advances in Knowledge Discovery and Data Mining, pp. 341\u2013352 (2013)","DOI":"10.1007\/978-3-642-37456-2_29"},{"key":"3590_CR21","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Christen, P., Verykios, V.S.: Efficient two-party private blocking based on sorted nearest neighborhood clustering. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, pp. 1949\u20131958 (2013)","DOI":"10.1145\/2505515.2505757"},{"key":"3590_CR22","doi-asserted-by":"crossref","unstructured":"Kuzu, M., Kantarcioglu, M., Inan, A., Bertino, E., Durham, E., Malin, B.: Efficient privacy-aware record integration. In: Proceedings of the 16th ACM International Conference on Extending Database Technology, pp. 167\u2013178 (2013)","DOI":"10.1145\/2452376.2452398"},{"key":"3590_CR23","doi-asserted-by":"crossref","unstructured":"Bonomi, L., Xiong, L., Chen, R., Fung, B.C.: Frequent grams based embedding for privacy preserving record linkage. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 1597\u20131601 (2012)","DOI":"10.1145\/2396761.2398480"},{"key":"3590_CR24","doi-asserted-by":"crossref","unstructured":"Inan, A., Kantarcioglu, M., Bertino, E., Scannapieco, M.: A hybrid approach to private record linkage. In: Proceedings of the 24th IEEE International Conference on Data Engineering, pp. 496\u2013505 (2008)","DOI":"10.1109\/ICDE.2008.4497458"},{"issue":"1","key":"3590_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s13222-019-00305-y","volume":"19","author":"M Franke","year":"2019","unstructured":"Franke, M., Gladbach, M., Sehili, Z., Rohde, F., Rahm, E.: ScaDS research on scalable privacy-preserving record linkage. Datenbank-Spektrum 19(1), 31\u201340 (2019)","journal-title":"Datenbank-Spektrum"},{"key":"3590_CR26","doi-asserted-by":"crossref","unstructured":"Christen, P., Vatsalan, D.: Flexible and extensible generation and corruption of personal data. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, pp. 1165\u20131168 (2013)","DOI":"10.1145\/2505515.2507815"},{"key":"3590_CR27","doi-asserted-by":"crossref","unstructured":"Ranbaduge, T., Vatsalan, D., Christen, P.: Clustering-based scalable indexing for multi-party privacy preserving record linkage. In: Pacific\u2013Asia Conference on Knowledge Discovery and Data Mining, pp. 549\u2013561 (2015)","DOI":"10.1007\/978-3-319-18032-8_43"},{"key":"3590_CR28","doi-asserted-by":"crossref","unstructured":"Ranbaduge, T., Vatsalan, D., Christen, P., Verykios, V.S.: Hashing-based distributed multi-party blocking for privacy-preserving record linkage. In: Pacific\u2013Asia Conference on Knowledge Discovery and Data Mining, pp. 415\u2013427 (2016)","DOI":"10.1007\/978-3-319-31750-2_33"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03590-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03590-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03590-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T19:09:01Z","timestamp":1727032141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03590-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,22]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["3590"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03590-7","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2022,4,22]]},"assertion":[{"value":"26 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}