{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:20:32Z","timestamp":1757618432388,"version":"3.44.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172082"],"award-info":[{"award-number":["62172082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007620","name":"Department of Education of Liaoning Province","doi-asserted-by":"publisher","award":["LJKQZ20222440"],"award-info":[{"award-number":["LJKQZ20222440"]}],"id":[{"id":"10.13039\/501100007620","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s44443-025-00104-4","type":"journal-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T05:13:13Z","timestamp":1751433193000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A multi-party privacy-preserving record linkage method based on improved secondary encoding"],"prefix":"10.1007","volume":"37","author":[{"given":"Shumin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"issue":"11","key":"104_CR1","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1109\/TKDE.2018.2874004","volume":"31","author":"P Christen","year":"2018","unstructured":"Christen P, Ranbaduge T, Vatsalan D, Schnell R (2018) Precise and fast cryptanalysis for bloom filter based privacy-preserving record linkage. IEEE Trans Knowl Data Eng 31(11):2164\u20132177","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"104_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","volume":"19","author":"AK Elmagarmid","year":"2006","unstructured":"Elmagarmid AK, Ipeirotis PG, Verykios VS (2006) Duplicate record detection: a survey. IEEE Trans Knowl Data Eng 19(1):1\u201316","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"104_CR3","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 (2021) Modern privacy-preserving record linkage techniques: an overview. IEEE Trans Inf Forensics Secur 16:4966\u20134987","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"9","key":"104_CR4","first-page":"2281","volume":"28","author":"SM Han","year":"2017","unstructured":"Han SM, Shen DR, Nie TZ, Kou Y, Yu G (2017) Multi-party privacy-preserving record linkage approach. J Softw 28(9):2281\u20132292","journal-title":"J Softw"},{"issue":"5","key":"104_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-019-9063-7","volume":"14","author":"SM Han","year":"2020","unstructured":"Han SM, Shen DR, Nie TZ, Kou Y, Yu G (2020) Efficient private multi-party numerical records matching. Front Comp Sci 14(5):145611","journal-title":"Front Comp Sci"},{"issue":"12","key":"104_CR6","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.3390\/math12121800","volume":"12","author":"SM Han","year":"2024","unstructured":"Han SM, Wang YZ, Shen DR, Wang C (2024) A multi-party privacy-preserving record linkage method based on secondary encoding. Mathematics 12(12):1800","journal-title":"Mathematics"},{"issue":"4","key":"104_CR7","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/TKDE.2014.2349916","volume":"27","author":"D Karapiperis","year":"2014","unstructured":"Karapiperis D, Verykios V (2014) An lsh-based blocking approach with a homomorphic matching technique for privacy-preserving record linkage. IEEE Trans Knowl Data Eng 27(4):909\u2013921","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"104_CR8","unstructured":"Lai PK, Yiu SM, Chow KP, Chong C, Hui LCK (2006) An efficient bloom filter based solution for multiparty private matching. In: Proceedings of the security and management. Citeseer, pp 286\u2013292"},{"key":"104_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1186\/s12920-018-0400-8","volume":"11","author":"P Laud","year":"2018","unstructured":"Laud P, Pankova A (2018) Privacy-preserving record linkage in large databases using secure multiparty computation. BMC Med Genomics 11:33\u201346","journal-title":"BMC Med Genomics"},{"key":"104_CR10","unstructured":"Li T, Gu Y, Zhou X, Ma Q, Yu G et\u00a0al (2017) An effective and efficient truth discovery framework over data streams. In: Proceedings of the 20th international conference on extending database technology, pp 180\u2013191"},{"issue":"1","key":"104_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1136\/amiajnl-2012-001509","volume":"20","author":"BA Malin","year":"2013","unstructured":"Malin BA, Emam KE, O\u2019Keefe CM (2013) Biomedical data privacy: problems, perspectives, and recent advances. J Am Med Inform Assoc 20(1):2\u20136","journal-title":"J Am Med Inform Assoc"},{"key":"104_CR12","doi-asserted-by":"crossref","unstructured":"Mirrokni V, Thorup M, Zadimoghaddam M (2018) Consistent hashing with bounded loads. In: Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms, SIAM, pp 587\u2013604","DOI":"10.1137\/1.9781611975031.39"},{"key":"104_CR13","doi-asserted-by":"crossref","unstructured":"Murray JS (2016) Probabilistic record linkage and deduplication after indexing, blocking, and filtering. arXiv: 6030.7816","DOI":"10.29012\/jpc.v7i1.643"},{"issue":"7","key":"104_CR14","doi-asserted-by":"publisher","first-page":"S595","DOI":"10.1016\/j.jval.2022.04.1627","volume":"25","author":"N Nguyen","year":"2022","unstructured":"Nguyen N, Connolly T, Overcash J, Hubbard A, Sudaria T (2022) Rwd103 evaluating a privacy preserving record linkage (pprl) solution to link de-identified patient records in rwd using default matching methods and machine learning methods. Value in Health 25(7):S595","journal-title":"Value in Health"},{"issue":"2","key":"104_CR15","first-page":"59","volume":"6","author":"F Niedermeyer","year":"2014","unstructured":"Niedermeyer F, Steinmetzer S, Kroll M, Schnell R (2014) Cryptanalysis of basic bloom filters used for privacy preserving record linkage. J Priv Confid 6(2):59\u201379","journal-title":"J Priv Confid"},{"key":"104_CR16","doi-asserted-by":"crossref","unstructured":"O\u2019Keefe CM, Yung M, Gu L, Baxter R (2004) Privacy-preserving data linkage protocols. In: Proceedings of the 2004 ACM workshop on privacy in the electronic society, pp 94\u2013102","DOI":"10.1145\/1029179.1029203"},{"key":"104_CR17","doi-asserted-by":"crossref","unstructured":"Ranbaduge T, Christen P, Schnell R (2020) Secure and accurate two-step hash encoding for privacy-preserving record linkage. In: Advances in knowledge discovery and data mining: 24th Pacific-Asia conference, PAKDD 2020, Singapore, May 11\u201314, 2020, Proceedings, Part II 24. Springer, pp 139\u2013151","DOI":"10.1007\/978-3-030-47436-2_11"},{"key":"104_CR18","doi-asserted-by":"crossref","unstructured":"Ranbaduge T, Schnell R (2020) Securing bloom filters for privacy-preserving record linkage. In: Proceedings of the 29th ACM international conference on information & knowledge management, pp 2185\u20132188","DOI":"10.1145\/3340531.3412105"},{"key":"104_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.jbi.2013.12.003","volume":"50","author":"SM Randall","year":"2014","unstructured":"Randall SM, Ferrante AM, Boyd JH, Bauer JK, Semmens JB (2014) Privacy-preserving record linkage on large real world datasets. J Biomed Inform 50:205\u2013212","journal-title":"J Biomed Inform"},{"key":"104_CR20","first-page":"350","volume":"11","author":"VM Shelake","year":"2020","unstructured":"Shelake VM, Shekokar NM (2020) Privacy preserving record linkage using phonetic and bloom filter encoding. Int J Adv Res Eng Technol 11:350\u2013362","journal-title":"Int J Adv Res Eng Technol"},{"issue":"3","key":"104_CR21","first-page":"394","volume":"13","author":"DN Tong","year":"2019","unstructured":"Tong DN, Shen DR, Han SM, Nie TZ, Kou Y, Yu G (2019) Multi-party strong-privacy-preserving record linkage method. J Front Comput Sci Technol 13(3):394","journal-title":"J Front Comput Sci Technol"},{"key":"104_CR22","unstructured":"Vatsalan D, Christen P (2016) Multi-party privacy-preserving record linkage using bloom filters. arXiv:1612.08835"},{"key":"104_CR23","doi-asserted-by":"crossref","unstructured":"Vatsalan D, Sehili Z, Christen P, Rahm E (2017) Privacy-preserving record linkage for big data: current approaches and research challenges. In: Proceedings of handbook of big data technologies. Springer, pp 851\u2013895","DOI":"10.1007\/978-3-319-49340-4_25"},{"issue":"1","key":"104_CR24","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1080\/03610926.2020.1743313","volume":"51","author":"RM Voogel","year":"2022","unstructured":"Voogel RM (2022) The geometric mean? Commun Stat-Theory Methods 51(1):82\u201394","journal-title":"Commun Stat-Theory Methods"},{"key":"104_CR25","doi-asserted-by":"crossref","unstructured":"Wang J, Li T, Wang A, Liu X, Chen L, Chen J, Liu J, Wu J, Li F, Gao Y (2023) Real-time workload pattern analysis for large-scale cloud databases. arXiv:2307.02626","DOI":"10.14778\/3611540.3611557"},{"issue":"2","key":"104_CR26","first-page":"154","volume":"50","author":"XD Ye","year":"2024","unstructured":"Ye XD, Zhao YY, Sun YQ, Zhao SC, Liu Z (2024) Privacy-preserving record linkage method based on variable-length coding and sliding window. Comput Eng 50(2):154\u2013164","journal-title":"Comput Eng"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00104-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00104-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00104-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T00:21:50Z","timestamp":1757204510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00104-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["104"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00104-4","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,7]]},"assertion":[{"value":"6 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"95"}}