{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:45:10Z","timestamp":1777704310575,"version":"3.51.4"},"reference-count":29,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,4,30]]},"abstract":"<jats:p>\u00a0Matching similar records from different databases to prevent duplication in a private manner has attracted plenty of attention, which is referred to as Private Entity Matching (PEM). In spite of various approaches having been proposed to solve this problem, private linking numerical data such as integer (e.g. age), floating point (e.g. body mass index) from multiple databases is an urgent gap, which is commonly required in health domain, statistical departments and more. Hence, this paper targets at solving the problem of linking numerical data from three or more sources in an efficient and secure way. Firstly, we introduce a novel homomorphic encryption method constrained similar modul, which provides strong privacy to encrypt numerical data in the range of real numbers. Then, to avoid frequent decryptions in the homomorphic encryption schema, we draw an inference about the encryption keys. Finally, an accelerated algorithm is proposed to reduce the complexity of multi-party numerical records matching. Our approach is considered absolute safety that no party learns any sensitive information of the others in the absence of collusion. Experiments on two real-world health information databases of patient records validate our approach with regards to the efficiency improvement and at the same time, at no the sacrifice of linkage quality.<\/jats:p>","DOI":"10.3233\/jifs-191064","type":"journal-article","created":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T13:49:49Z","timestamp":1586267389000},"page":"4403-4414","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["A private entity matching approach for multiple databases"],"prefix":"10.1177","volume":"38","author":[{"given":"Shumin","family":"Han","sequence":"first","affiliation":[{"name":"College of Computer Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Shen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiezheng","family":"Nie","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Kou","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,4,3]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","unstructured":"ChristenP. Data Matching: Concepts and Techniques for Record Linkage Entity Resolution and Duplicate Detection. Data-Centric Systems and Applications Springer (2012).","DOI":"10.1007\/978-3-642-31164-2"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"CliftonC. KantarciogluM. DoanA. SchadowG. Vaidya ElmagarmidJ. SuciuD. Privacy-preserving data integration and sharing In Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2004) 19\u201326.","DOI":"10.1145\/1008694.1008698"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","unstructured":"VatsalanD. ChristenP. VerykiosV.S. Privacy-Preserving Record Linkage Encyclopedia of Big Data Technologies (2019).","DOI":"10.1007\/978-3-319-77525-8_17"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-019-00305-y"},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","unstructured":"LaudP. and PankovaA. Privacy-preserving record linkage in large databases using secure multiparty computation In Proceedings of the 6th iDASH Privacy and Security Workshop (2018) 84.","DOI":"10.1186\/s12920-018-0400-8"},{"key":"e_1_3_2_7_2","first-page":"946","article-title":"A taxonomy of privacy-preserving record linkage techniques","volume":"38","author":"Vatsalan D.","year":"2013","unstructured":"VatsalanD., ChristenP. and VerykiosV.S., A taxonomy of privacy-preserving record linkage techniques, Information Systems Journal 38 (2013), 946\u2013969.","journal-title":"Information Systems Journal"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"VatsalanD. SehiliZ. ChristenP. and RahmE. Privacy-Preserving Record Linkage for Big Data: Current Approaches and Research Challenges Handbook of Big Data Technologies (2017).","DOI":"10.1007\/978-3-319-49340-4_25"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJDMMM.2009.026076"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"DuW. and AtallahM. Protocols for secure remote database access with approximate matching In Processings of E-Commerce Security and Privacy (2001) 87\u2013111.","DOI":"10.1007\/978-1-4615-1467-1_6"},{"key":"e_1_3_2_11_2","first-page":"253","article-title":"Privacy-preserving string comparisons in record linkage systems: a review","volume":"17","author":"Trepetin S.","year":"2008","unstructured":"TrepetinS., Privacy-preserving string comparisons in record linkage systems: a review, Information Security Journal 17 (2008), 253\u2013266.","journal-title":"Information Security Journal"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0214-6"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2015.12.004"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"VidanageA. RanbadugeT. ChristenP. and SchnellR. Effient pattern mining based cryptanalysis for privacy-preserving record linkage IEEE 35th International Conference on Data Engineering (2019).","DOI":"10.1109\/ICDE.2019.00176"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2011.04.004"},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","unstructured":"KuzuM. KantarciogluM. DurhaE. and MalinB. A constraint satisfaction cryptanalysis of Bloom filters in private record linkage In: Proceedings of the 11th International Conference on Privacy Enhancing Technologies (2011) 226\u2013245.","DOI":"10.1007\/978-3-642-22263-4_13"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1386-5056(98)00019-7"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"O\u2019KeefeC. YungM. GuL. and BaxterR. Privacy-preserving data linkage protocols In: Processings of ACM Workshop on Privacy in the Electronic Society (2004) 94\u2013102.","DOI":"10.1145\/1029179.1029203"},{"key":"e_1_3_2_19_2","unstructured":"KantarciogluM. JiangW. and MalinB. A privacy-preserving framework for integrating person-specific databases In PSD (2008)."},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","unstructured":"KarapiperisD. VatsalanD. VerykiosV.S. and ChristenP. Large scale multi-party counting set intersection using a space efficient global synopsis In: Processings of 20th International Conference on Database Systems for Advanced Applications (2015) 329\u2013345.","DOI":"10.1007\/978-3-319-18123-3_20"},{"key":"e_1_3_2_21_2","unstructured":"LaiP. YiuS. ChowK. ChongC. and HuiL. An Efficient Bloom filter based Solution for Multi-party Private Matching In SAM (2006)."},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","unstructured":"VatsalanD. and ChristenP. Scalable privacy-preserving record linkage for multiple databases In: Proceedings of the 23th ACM International Conference on Information and Knowledge Management (2014) 1795\u20131798.","DOI":"10.1145\/2661829.2661875"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","unstructured":"VatsalanD. and ChristenP. Scalable privacy-preserving linking of multiple databases using counting Bloom filters In: Proceedings of IEEE 16th International Conference on Data Mining Workshops (2017).","DOI":"10.1109\/ICDMW.2016.0130"},{"key":"e_1_3_2_24_2","unstructured":"DurhamE. A Framework for Accurate Efficient Private Record Linkage Ph.D. Thesis Vanderbilt University (2012)."},{"key":"e_1_3_2_25_2","article-title":"Homomorapic Encryption Scheme in the Range of the Real","volume":"20","author":"Xiang G.L.","year":"2005","unstructured":"XiangG.L. and ChenX.M., Homomorapic Encryption Scheme in the Range of the Real, Journal of Computer Engineering Application 20 (2005).","journal-title":"Journal of Computer Engineering Application"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00170-6"},{"key":"e_1_3_2_27_2","doi-asserted-by":"crossref","unstructured":"KuzuM. and InanA. Efficient privacy-aware record integration In: Proceedings of the 16th In-ternational Conference on Extending Database Technology (2013) 167\u2013178.","DOI":"10.1145\/2452376.2452398"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2015.01.009"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250581"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191064","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-191064","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:55Z","timestamp":1777455655000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-191064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,3]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4,30]]}},"alternative-id":["10.3233\/JIFS-191064"],"URL":"https:\/\/doi.org\/10.3233\/jifs-191064","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,3]]}}}