{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T04:48:12Z","timestamp":1766983692217,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T00:00:00Z","timestamp":1629590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["81701794"],"award-info":[{"award-number":["81701794"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Innovation and Entrepreneurship Training Program of under Graduate","award":["202010504076"],"award-info":[{"award-number":["202010504076"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>With the development of information technology, it has become a popular topic to share data from multiple sources without privacy disclosure problems. Privacy-preserving record linkage (PPRL) can link the data that truly matches and does not disclose personal information. In the existing studies, the techniques of PPRL have mostly been studied based on the alphabetic language, which is much different from the Chinese language environment. In this paper, Chinese characters (identification fields in record pairs) are encoded into strings composed of letters and numbers by using the SoundShape code according to their shapes and pronunciations. Then, the SoundShape codes are encrypted by Bloom filter, and the similarity of encrypted fields is calculated by Dice similarity. In this method, the false positive rate of Bloom filter and different proportions of sound code and shape code are considered. Finally, we performed the above methods on the synthetic datasets, and compared the precision, recall, F1-score and computational time with different values of false positive rate and proportion. The results showed that our method for PPRL in Chinese language environment improved the quality of the classification results and outperformed others with a relatively low additional cost of computation.<\/jats:p>","DOI":"10.3390\/e23081091","type":"journal-article","created":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T21:47:52Z","timestamp":1629668872000},"page":"1091","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Improved Chinese String Comparator for Bloom Filter Based Privacy-Preserving Record Linkage"],"prefix":"10.3390","volume":"23","author":[{"given":"Siqi","family":"Sun","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Huazhong Agricultural University, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yining","family":"Qian","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Huazhong Agricultural University, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruoshi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Huazhong Agricultural University, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanqi","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Huazhong Agricultural University, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5678-6829","authenticated-orcid":false,"given":"Xinran","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Huazhong Agricultural University, Wuhan 430070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,8,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1097\/00005650-199606000-00007","article-title":"Record linkage strategies, outpatient procedures, and administrative data","volume":"34","author":"Roos","year":"1996","journal-title":"Med. Care"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.jbi.2013.12.003","article-title":"Privacy-preserving record linkage on large real world datasets","volume":"50","author":"Randall","year":"2014","journal-title":"J. Biomed. Inform."},{"key":"ref_3","unstructured":"Bonomi, L., Xiong, L., Chen, R., and Fung, B.C.M. (2012). Privacy Preserving Record Linkage via grams Projections. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Inan, A., Kantarcioglu, M., Ghinita, G., and Bertino, E. (2010, January 22\u201326). Private Record Matching Using Differential Privacy. Proceedings of the 13th International Conference on Extending Database Technology, Lausanne, Switzerland.","DOI":"10.1145\/1739041.1739059"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Kuzu, M., Kantarcioglu, M., Inan, A., Bertino, E., Durham, E., and Malin, B. (2013, January 18\u201322). Efficient Privacy-Aware Record Integration. Proceedings of the 16th International Conference on Extending Database Technology, Genoa, Italy.","DOI":"10.1145\/2452376.2452398"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Vatsalan, D., Sehili, Z., Christen, P., and Rahm, E. (2017). Privacy-Preserving Record Linkage for Big Data: Current Approaches and Research Challenges. Handbook of Big Data Technologies, Springer International Publishing.","DOI":"10.1007\/978-3-319-49340-4_25"},{"key":"ref_7","first-page":"271","article-title":"Secure pseudonymisation for privacy-preserving probabilistic record linkage","volume":"34","author":"Smith","year":"2017","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Shekokar, N., and Shelake, V.M. (2020, January 27\u201329). An Enhanced Approach for Privacy Preserving Record Linkage during Data Integration. Proceedings of the 2020 6th International Conference on Information Management (ICIM), London, UK.","DOI":"10.1109\/ICIM49319.2020.244689"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2623","DOI":"10.1109\/TIFS.2019.2903651","article-title":"Secure Approximate String Matching for Privacy-Preserving Record Linkage","volume":"14","author":"Essex","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Schnell, R., Bachteler, T., and Reiher, J. (2009). Privacy-preserving record linkage using Bloom filters. BMC Med Inform. Decis. Mak., 9.","DOI":"10.1186\/1472-6947-9-41"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., and Rashidi, L. (2018). Pattern-Mining Based Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage. Advances in Knowledge Discovery and Data Mining, Springer International Publishing.","DOI":"10.1007\/978-3-319-93040-4"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ranbaduge, T., and Schnell, R. (2020). Securing Bloom Filters for Privacy-Preserving Record Linkage, Association for Computing Machinery.","DOI":"10.1145\/3340531.3412105"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Landau, G.M., and Amir, A. (2001). Better Filtering with Gapped q-Grams. Combinatorial Pattern Matching, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-48194-X"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3735","DOI":"10.1109\/ACCESS.2020.3047927","article-title":"String Comparators for Chinese-Characters-Based Record Linkages","volume":"9","author":"Xu","year":"2021","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2956","DOI":"10.1109\/TKDE.2013.91","article-title":"Composite Bloom Filters for Secure Record Linkage","volume":"26","author":"Durham","year":"2014","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_16","first-page":"59","article-title":"Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage","volume":"6","author":"Niedermeyer","year":"2014","journal-title":"J. Priv. Confidentiality"},{"key":"ref_17","first-page":"37","article-title":"Phone-shape combination, location code\u2014A Chinese character coding scheme using stroke order","volume":"4","author":"Zhang","year":"1980","journal-title":"Power Syst. Autom."},{"key":"ref_18","first-page":"255","article-title":"Study on Stroke Coding Input Method of Chinese Characaters","volume":"26","author":"Chen","year":"2007","journal-title":"J. Shantou Univ. Sci. Ed."},{"key":"ref_19","first-page":"252","article-title":"Study on Pinyin-Stroke Coding Input Method of Chinese Characters","volume":"26","author":"Chen","year":"2010","journal-title":"Microcomput. Inf."},{"key":"ref_20","unstructured":"Chen, Q.W., and Yu, W. (2016). Chinese Character Inputting Method of New Phonogram Code. (No. CN201210018390.6), Chinese Patent, (In Chinese)."},{"key":"ref_21","unstructured":"Du, B. (1995). Method of Inputting CHINESE Characters Using the Holo-Information Code for Chinese Characters and Keyboard Therefor. (No. 5,475,767), U.S. Patent."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhang, Y., Yang, L., and Wang, C. (2020). Chinese Text Error Correction Suggestion Generation Based on SoundShape Code, Springer International Publishing.","DOI":"10.1007\/978-3-030-38189-9_44"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2164","DOI":"10.1109\/TKDE.2018.2874004","article-title":"Precise and Fast Cryptanalysis for Bloom Filter Based Privacy-Preserving Record Linkage","volume":"31","author":"Christen","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TNET.2002.803864","article-title":"Compressed Bloom filters","volume":"10","author":"Mitzenmacher","year":"2002","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_25","first-page":"73","article-title":"Chinese characters similarity comparison algorithm based on phonetic code and shape code","volume":"11","author":"Chen","year":"2018","journal-title":"Inf. Technol."},{"key":"ref_26","unstructured":"Winkler, W.E. Improved Decision Rules in The Fellegi-Sunter Model of Record Linkage. Proceedings of the Section on Survey Research Methods."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","article-title":"A Theory for Record Linkage","volume":"64","author":"Fellegi","year":"1969","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Li, X., Guttmann, A., Cipi\u00e8re, S., Maigne, L., Demongeot, J., Boire, J.Y., and Ouchchane, L. (2014, January 1\u20134). Implementation of an extended Fellegi-Sunter probabilistic record linkage method using the Jaro-Winkler string comparator. Proceedings of the IEEE-EMBS International Conference on Biomedical and Health Informatics (BHI), Valencia, Spain.","DOI":"10.1109\/BHI.2014.6864381"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s11222-017-9746-6","article-title":"A note on using the F-measure for evaluating record linkage algorithms","volume":"28","author":"Hand","year":"2018","journal-title":"Stat. Comput."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/8\/1091\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:49:03Z","timestamp":1760165343000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/8\/1091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,22]]},"references-count":29,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["e23081091"],"URL":"https:\/\/doi.org\/10.3390\/e23081091","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,8,22]]}}}