Version 1
: Received: 5 October 2022 / Approved: 6 October 2022 / Online: 6 October 2022 (10:31:25 CEST)
How to cite:
Khan, S.I.; Hosen, R.; Hossain, I. Secure Approximate String Matching using Homomorphic Encryption for Privacy-preserving Record Linkage. Preprints2022, 2022100064. https://doi.org/10.20944/preprints202210.0064.v1
Khan, S.I.; Hosen, R.; Hossain, I. Secure Approximate String Matching using Homomorphic Encryption for Privacy-preserving Record Linkage. Preprints 2022, 2022100064. https://doi.org/10.20944/preprints202210.0064.v1
Khan, S.I.; Hosen, R.; Hossain, I. Secure Approximate String Matching using Homomorphic Encryption for Privacy-preserving Record Linkage. Preprints2022, 2022100064. https://doi.org/10.20944/preprints202210.0064.v1
APA Style
Khan, S.I., Hosen, R., & Hossain, I. (2022). Secure Approximate String Matching using Homomorphic Encryption for Privacy-preserving Record Linkage. Preprints. https://doi.org/10.20944/preprints202210.0064.v1
Chicago/Turabian Style
Khan, S.I., Rakib Hosen and Iqbal Hossain. 2022 "Secure Approximate String Matching using Homomorphic Encryption for Privacy-preserving Record Linkage" Preprints. https://doi.org/10.20944/preprints202210.0064.v1
Abstract
String matching is an important part in many real world applications. It must robust against variations in string field. In record linkage for two different datasets matching should detect two patients in common in spite of small variations. But it becomes difficult in case of confidential data because sometimes data sharing between organizations become restricted for privacy purposes. Several techniques have been proposed on privacy-preserving approximate string matching such as Secure Hash Encoding etc. Relative to other techniques for approximate string matching Homomorphic encryption is very new.
In this paper we have proposed a Homomorphic Encryption based approximate string matching technique for matching multiple attributes. There is no solution currently available for multiple attributes matching using Homomorphic encryption. We have proposed two different methods for multiple attributes matching. Compare to other existing approaches our proposed method offers security guarantees and greater matching accuracy.
Keywords
Homomorphic Encryption; Privacy-preserving Record Linkage; approximate string matching
Subject
Computer Science and Mathematics, Information Systems
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The commenter has declared there is no conflict of interests.