{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:44:57Z","timestamp":1761677097147,"version":"3.37.3"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T00:00:00Z","timestamp":1649808000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T00:00:00Z","timestamp":1649808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP160101934"],"award-info":[{"award-number":["DP160101934"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The task of calculating similarities between strings held by different organisations without revealing these strings is an increasingly important problem in areas such as health informatics, national censuses, genomics, and fraud detection. Most existing privacy-preserving string matching approaches are either based on comparing sets of encoded characters allowing only exact matching of encoded strings, or they are aimed at long genomics sequences that have a small alphabet. The set-based privacy-preserving similarity functions that are commonly used to compare name and address strings in the context of privacy-preserving record linkage do not take the positions of sub-strings into account. As a result, two very different strings can potentially be considered as a match leading to wrongly linked records. Furthermore, existing set-based techniques cannot identify the length of the longest common sub-string across two strings. In this paper, we propose two new approaches for accurate and efficient privacy-preserving string matching that provide privacy against various attacks. In the first approach we apply hashing-based encoding on sub-strings (q-grams) to compare sensitive strings, while in the second approach we generate one-bit array from the sub-strings of a string to identify the longest common bit sequences. We evaluate our approaches on several data sets with different types of strings, and validate their privacy, accuracy, and complexity compared to three baseline techniques, showing that they outperform all baselines.<\/jats:p>","DOI":"10.1007\/s41060-022-00320-5","type":"journal-article","created":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T21:03:02Z","timestamp":1649883782000},"page":"191-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Accurate and efficient privacy-preserving string matching"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1391-6160","authenticated-orcid":false,"given":"Sirintra","family":"Vaiwsri","sequence":"first","affiliation":[]},{"given":"Thilina","family":"Ranbaduge","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"key":"320_CR1","unstructured":"Ash, R.B.: Basic probability theory. Courier Corporation (2008)"},{"key":"320_CR2","unstructured":"Benford, F.: The law of anomalous numbers. In Proceedings of the American philosophical society pp. 551\u2013572 (1938)"},{"key":"320_CR3","doi-asserted-by":"publisher","unstructured":"Bezawada, B., Liu, A.X., Jayaraman, B., Wang, A.L., Li, R.: Privacy preserving string matching for cloud computing. In 2015 IEEE 35th International Conference on Distributed Computing Systems, pp. 609\u2013618. IEEE (2015). https:\/\/doi.org\/10.1109\/ICDCS.2015.68","DOI":"10.1109\/ICDCS.2015.68"},{"key":"320_CR4","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2396761.2398480","DOI":"10.1145\/2396761.2398480"},{"key":"320_CR5","doi-asserted-by":"publisher","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171), pp. 21\u201329. IEEE (1997). https:\/\/doi.org\/10.1109\/SEQUEN.1997.666900","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"320_CR6","first-page":"638","volume":"2014","author":"M Chase","year":"2014","unstructured":"Chase, M., Shen, E.: Pattern matching encryption. IACR Cryptol. ePrint Arch. 2014, 638 (2014)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"11","key":"320_CR7","doi-asserted-by":"publisher","first-page":"2677","DOI":"10.1109\/TIFS.2018.2825141","volume":"13","author":"F Chen","year":"2018","unstructured":"Chen, F., Wang, D., Li, R., Chen, J., Ming, Z., Liu, A.X., Duan, H., Wang, C., Qin, J.: Secure hashing-based verifiable pattern matching. IEEE Trans. Inf. Forensics Secur. 13(11), 2677\u20132690 (2018). https:\/\/doi.org\/10.1109\/TIFS.2018.2825141","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"320_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3047307","volume":"50","author":"L Chi","year":"2017","unstructured":"Chi, L., Zhu, X.: Hashing techniques: a survey and taxonomy. ACM Comput. Surv. (CSUR) 50(1), 1\u201336 (2017). https:\/\/doi.org\/10.1145\/3047307","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"320_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching","author":"P Christen","year":"2012","unstructured":"Christen, P.: Data Matching. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"key":"320_CR10","volume-title":"Preparation of a Real Voter Data Set for Record Linkage and Duplicate Detection Research","author":"P Christen","year":"2013","unstructured":"Christen, P.: Preparation of a Real Voter Data Set for Record Linkage and Duplicate Detection Research. Australian Nat. Univ, Canberra, Australia (2013)"},{"key":"320_CR11","doi-asserted-by":"publisher","unstructured":"Christen, P., Ranbaduge, T., Schnell, R.: Linking Sensitive Data: Methods and Techniques for Practical Privacy-Preserving Information Sharing. Springer International Publishing AG (2020). https:\/\/doi.org\/10.1007\/978-3-030-59706-1","DOI":"10.1007\/978-3-030-59706-1"},{"key":"320_CR12","doi-asserted-by":"publisher","unstructured":"Christen, P., Schnell, R., Vatsalan, D., Ranbaduge, T.: Efficient cryptanalysis of Bloomfilters for privacy-preserving record linkage. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 628\u2013640. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_49","DOI":"10.1007\/978-3-319-57454-7_49"},{"key":"320_CR13","doi-asserted-by":"publisher","unstructured":"Christen, P., Vidanage, A., Ranbaduge, T., Schnell, R.: Pattern-mining based cryptanalysis of Bloom filters for privacy-preserving record linkage. In Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 530\u2013542. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_42","DOI":"10.1007\/978-3-319-93040-4_42"},{"key":"320_CR14","doi-asserted-by":"publisher","unstructured":"Conrad, K.: Stirling\u2019s formula. Available in http:\/\/www.math.uconn.edu\/kconrad\/blu rbs\/analysis\/stirling.pdf (2016). https:\/\/doi.org\/10.1002\/0471667196.ess2579.pub2","DOI":"10.1002\/0471667196.ess2579.pub2"},{"key":"320_CR15","unstructured":"Culnane, C., Rubinstein, B.I., Teague, V.: Options for Encoding Names for Data Linking at the Australian Bureau of Statistics. arXiv preprint arXiv:1802.07975 (2018)"},{"key":"320_CR16","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: Efficient and secure comparison for on-line auctions. In Australasian Conference on Information Security and Privacy, pp. 416\u2013430. Springer (2007)","DOI":"10.1007\/978-3-540-73458-1_30"},{"key":"320_CR17","doi-asserted-by":"publisher","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, pp. 789\u2013800 (2013). https:\/\/doi.org\/10.1145\/2508859.2516701","DOI":"10.1145\/2508859.2516701"},{"issue":"1","key":"320_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00578ED1V01Y201404DTM040","volume":"7","author":"XL Dong","year":"2015","unstructured":"Dong, X.L., Srivastava, D.: Big data integration. Synth. Lect. Data Manage. 7(1), 1\u2013198 (2015). https:\/\/doi.org\/10.2200\/S00578ED1V01Y201404DTM040","journal-title":"Synth. Lect. Data Manage."},{"key":"320_CR19","unstructured":"Durham, E.A.: A framework for accurate, efficient private record linkage. Ph.D. thesis, Faculty of the Graduate School of Vanderbilt University, Nashville, TN (2012)"},{"key":"320_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. Autom. Lang. Programm. (2006). https:\/\/doi.org\/10.1007\/11787006_1","journal-title":"Autom. Lang. Programm."},{"issue":"25","key":"320_CR21","doi-asserted-by":"publisher","first-page":"14863","DOI":"10.1073\/pnas.95.25.14863","volume":"95","author":"MB Eisen","year":"1998","unstructured":"Eisen, M.B., Spellman, P.T., Brown, P.O., Botstein, D.: Cluster analysis and display of genome-wide expression patterns. Proc. Natl. Acad. Sci. 95(25), 14863\u201314868 (1998)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"320_CR22","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985). https:\/\/doi.org\/10.1109\/TIT.1985.1057074","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"320_CR23","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1109\/TIFS.2019.2903651","volume":"14","author":"A Essex","year":"2019","unstructured":"Essex, A.: Secure approximate string matching for privacy-preserving record linkage. IEEE Trans. Inf. Forensics Secur. 14(10), 2623\u20132632 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"320_CR24","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 390\u2013398. IEEE (2000)"},{"issue":"5","key":"320_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(96)00170-6","volume":"60","author":"JD Ferrer","year":"1996","unstructured":"Ferrer, J.D.: A new privacy homomorphism and applications. Inf. Process. Lett. 60(5), 277\u2013282 (1996). https:\/\/doi.org\/10.1016\/S0020-0190(96)00170-6","journal-title":"Inf. Process. Lett."},{"key":"320_CR26","doi-asserted-by":"publisher","unstructured":"Franklin, M.K., Reiter, M.K.: Fair exchange with a semi-trusted third party. In Proceedings of the 4th ACM Conference on Computer and Communications Security, pp. 1\u20135 (1997). https:\/\/doi.org\/10.1145\/266420.266424","DOI":"10.1145\/266420.266424"},{"key":"320_CR27","unstructured":"Goldreich, O.: Secure multi-party computation. Tech. rep., Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Israel (2002)"},{"issue":"5","key":"320_CR28","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1063\/1.4822863","volume":"3","author":"RL Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O., Liu, S.: Concrete mathematics: a foundation for computer science. Comput. Phys. 3(5), 106\u2013107 (1989)","journal-title":"Comput. Phys."},{"key":"320_CR29","doi-asserted-by":"publisher","unstructured":"Hahn, F., Loza, N., Kerschbaum, F.: Practical and secure substring search. In Proceedings of the 2018 International Conference on Management of Data, pp. 163\u2013176 (2018). https:\/\/doi.org\/10.1145\/3183713.3183754","DOI":"10.1145\/3183713.3183754"},{"key":"320_CR30","doi-asserted-by":"publisher","unstructured":"Hall, R., Fienberg, S.E.: Privacy-preserving record linkage. In International Conference on Privacy in Statistical Databases, pp. 269\u2013283. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15838-4_24","DOI":"10.1007\/978-3-642-15838-4_24"},{"issue":"2","key":"320_CR31","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10623-005-6343-z","volume":"38","author":"A Juels","year":"2006","unstructured":"Juels, A., Sudan, M.: A fuzzy vault scheme. Des. Codes Crypt. 38(2), 237\u2013257 (2006)","journal-title":"Des. Codes Crypt."},{"key":"320_CR32","doi-asserted-by":"publisher","unstructured":"Karakasidis, A., Verykios, V.S., Christen, P.: Fake injection strategies for private phonetic matching. In Data Privacy Management and Autonomous Spontaneus Security, pp. 9\u201324. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-28879-1_2","DOI":"10.1007\/978-3-642-28879-1_2"},{"issue":"2","key":"320_CR33","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TKDE.2017.2761759","volume":"30","author":"D Karapiperis","year":"2017","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 (2017). https:\/\/doi.org\/10.1109\/TKDE.2017.2761759","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"320_CR34","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10115-016-0919-y","volume":"49","author":"D Karapiperis","year":"2016","unstructured":"Karapiperis, D., Verykios, V.S.: A fast and efficient hamming lsh-based scheme for accurate linkage. Knowl. Inf. Syst. 49(3), 861\u2013884 (2016). https:\/\/doi.org\/10.1007\/s10115-016-0919-y","journal-title":"Knowl. Inf. Syst."},{"key":"320_CR35","doi-asserted-by":"publisher","unstructured":"Kerschbaum, F.: Frequency-hiding order-preserving encryption. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 656\u2013667 (2015). https:\/\/doi.org\/10.1145\/2810103.2813629","DOI":"10.1145\/2810103.2813629"},{"key":"320_CR36","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Confid. (2009). https:\/\/doi.org\/10.29012\/jpc.v1i1.566","DOI":"10.29012\/jpc.v1i1.566"},{"issue":"2","key":"320_CR37","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM (JACM) 23(2), 262\u2013272 (1976). https:\/\/doi.org\/10.1145\/321941.321946","journal-title":"J. ACM (JACM)"},{"key":"320_CR38","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. CUP (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"320_CR39","doi-asserted-by":"crossref","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 (2021)","DOI":"10.1145\/3412841.3442079"},{"key":"320_CR40","doi-asserted-by":"crossref","unstructured":"Nakagawa, Y., Ohata, S., Shimizu, K.: Efficient privacy-preserving variable-length substring match for genome sequence. In 21st International Workshop on Algorithms in Bioinformatics (WABI 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)","DOI":"10.1186\/s13015-022-00211-1"},{"issue":"1","key":"320_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12874-022-01510-2","volume":"22","author":"S Randall","year":"2022","unstructured":"Randall, S., Wichmann, H., Brown, A., Boyd, J., Eitelhuber, T., Merchant, A., Ferrante, A.: A blinded evaluation of privacy preserving record linkage with Bloom filters. BMC Med. Res. Methodol. 22(1), 1\u20137 (2022)","journal-title":"BMC Med. Res. Methodol."},{"key":"320_CR42","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.jbi.2013.12.003","volume":"50","author":"SM Randall","year":"2014","unstructured":"Randall, S.M., Ferrante, A.M., Boyd, J.H., Bauer, J.K., Semmens, J.B.: Privacy-preserving record linkage on large real world datasets. J. Biomed. Inform. 50, 205\u2013212 (2014). https:\/\/doi.org\/10.1016\/j.jbi.2013.12.003","journal-title":"J. Biomed. Inform."},{"key":"320_CR43","unstructured":"Schneier, B., et\u00a0al.: Applied cryptography-protocols, algorithms, and source code in c (1996)"},{"issue":"1","key":"320_CR44","doi-asserted-by":"publisher","first-page":"1","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), 1\u201311 (2009). https:\/\/doi.org\/10.1186\/1472-6947-9-41","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"320_CR45","doi-asserted-by":"publisher","unstructured":"Schnell, R., Borgs, C.: Encoding hierarchical classification codes for privacy-preserving record linkage using Bloom filters. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 142\u2013156. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-43887-6_12","DOI":"10.1007\/978-3-030-43887-6_12"},{"key":"320_CR46","doi-asserted-by":"publisher","unstructured":"Schnell, R., Borgs, C.: Encoding diagnostic codes for privacy-preserving record linkage. Int. J. Popul. Data Sci. (2020). https:\/\/doi.org\/10.23889\/ijpds.v5i5.1461","DOI":"10.23889\/ijpds.v5i5.1461"},{"key":"320_CR47","doi-asserted-by":"publisher","unstructured":"Schnell, R., Klingwort, J., Farrow, J.M.: Locational privacy-preserving distance computations with intersecting sets of randomly labeled grid points. Int. J. Health Geogr. 20(1), 1\u201316 (2021). https:\/\/doi.org\/10.1186\/s12942-021-00268-y","DOI":"10.1186\/s12942-021-00268-y"},{"issue":"3","key":"320_CR48","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C Shannon","year":"1948","unstructured":"Shannon, C.: A mathematical theory of communication. Bell Syst. Technol. J. 27(3), 379\u2013423 (1948). https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst. Technol. J."},{"key":"320_CR49","doi-asserted-by":"publisher","unstructured":"Sheikh, R., Mishra, D.K.: Protocols for getting maximum value for multi-party computations. In 2010 Fourth Asia International Conference on Mathematical\/Analytical Modelling and Computer Simulation, pp. 597\u2013600. IEEE (2010). https:\/\/doi.org\/10.1109\/AMS.2010.120","DOI":"10.1109\/AMS.2010.120"},{"issue":"11","key":"320_CR50","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1093\/bioinformatics\/btw050","volume":"32","author":"K Shimizu","year":"2016","unstructured":"Shimizu, K., Nuida, K., R\u00e4tsch, G.: Efficient privacy-preserving string search and an application in genomics. Bioinformatics 32(11), 1652\u20131661 (2016). https:\/\/doi.org\/10.1093\/bioinformatics\/btw050","journal-title":"Bioinformatics"},{"key":"320_CR51","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.jisa.2017.01.002","volume":"34","author":"D Smith","year":"2017","unstructured":"Smith, D.: Secure pseudonymisation for privacy-preserving probabilistic record linkage. J. Inf. Secur. Appl. 34, 271\u2013279 (2017). https:\/\/doi.org\/10.1016\/j.jisa.2017.01.002","journal-title":"J. Inf. Secur. Appl."},{"issue":"5","key":"320_CR52","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1109\/TCBB.2018.2814039","volume":"16","author":"H Sudo","year":"2018","unstructured":"Sudo, H., Jimbo, M., Nuida, K., Shimizu, K.: Secure wavelet matrix: alphabet-friendly privacy-preserving string search for bioinformatics. IEEE\/ACM Trans. Comput. Biol. Bioinf. 16(5), 1675\u20131684 (2018)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"8","key":"320_CR53","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.3390\/e23081091","volume":"23","author":"S Sun","year":"2021","unstructured":"Sun, S., Qian, Y., Zhang, R., Wang, Y., Li, X.: An improved chinese string comparator for Bloom filter based privacy-preserving record linkage. Entropy 23(8), 1091 (2021)","journal-title":"Entropy"},{"key":"320_CR54","doi-asserted-by":"publisher","unstructured":"Ukkonen, E.: Approximate string-matching over suffix trees. In Annual Symposium on Combinatorial Pattern Matching, pp. 228\u2013242. Springer (1993). https:\/\/doi.org\/10.1007\/BFb0029808","DOI":"10.1007\/BFb0029808"},{"key":"320_CR55","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.jbi.2015.12.004","volume":"59","author":"D Vatsalan","year":"2016","unstructured":"Vatsalan, D., Christen, P.: Privacy-preserving matching of similar patients. J. Biomed. Inform. 59, 285\u2013298 (2016). https:\/\/doi.org\/10.1016\/j.jbi.2015.12.004","journal-title":"J. Biomed. Inform."},{"issue":"6","key":"320_CR56","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). https:\/\/doi.org\/10.1016\/j.is.2012.11.005","journal-title":"Inf. Syst."},{"key":"320_CR57","doi-asserted-by":"publisher","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 (2017). https:\/\/doi.org\/10.1007\/978-3-319-49340-4_25","DOI":"10.1007\/978-3-319-49340-4_25"},{"issue":"1","key":"320_CR58","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/2627692.2627706","volume":"43","author":"S Wandelt","year":"2014","unstructured":"Wandelt, S., Deng, D., Gerdjikov, S., Mishra, S., Mitankin, P., Patil, M., Siragusa, E., Tiskin, A., Wang, W., Wang, J., et al.: State-of-the-art in string similarity search and join. ACM SIGMOD Rec. 43(1), 64\u201376 (2014). https:\/\/doi.org\/10.1145\/2627692.2627706","journal-title":"ACM SIGMOD Rec."},{"key":"320_CR59","doi-asserted-by":"publisher","unstructured":"Wang, J., Yang, X., Wang, B., Liu, C.: An adaptive approach of approximate substring matching. In International Conference on Database Systems for Advanced Applications, pp. 501\u2013516. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-32025-0_31","DOI":"10.1007\/978-3-319-32025-0_31"},{"key":"320_CR60","doi-asserted-by":"publisher","unstructured":"Zarezadeh, M., Mala, H., Ladani, B.T.: Efficient secure pattern matching with malicious adversaries. In: IEEE Transactions on Dependable and Secure Computing (2020). https:\/\/doi.org\/10.1109\/TDSC.2020.3009595","DOI":"10.1109\/TDSC.2020.3009595"},{"key":"320_CR61","volume-title":"Human Behavior and the Principle of Least Effort","author":"G Zipf","year":"1949","unstructured":"Zipf, G.: Human Behavior and the Principle of Least Effort. Addison-Wesley Press, Boston (1949)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-022-00320-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-022-00320-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-022-00320-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T20:07:53Z","timestamp":1657915673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-022-00320-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,13]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["320"],"URL":"https:\/\/doi.org\/10.1007\/s41060-022-00320-5","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2022,4,13]]},"assertion":[{"value":"8 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"On behalf of all authors, the first author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}