Real-world applications of record linkage often require matching to be robust in spite of small variations in string fields. For example, two health-care providers should be able to detect a patient in common, even if one record contains a typo or transcription error. In the privacy-preserving setting, however,the problem of approximate string matching has been cast as a trade-off between security and practicality, and the literature has focused mainly on Bloom filter encodings, an approach which can leak significant information about the underlying records.We present a novel public-key construction for secure two party evaluation of threshold functions in restricted domains based on embeddings found in the message spaces of additively homomorphic encryption schemes. We use this to construct an efficient two-party protocol for privately computing the threshold Dice coefficient. Relative to the approach of Bloom filter encodings, our proposal offers formal security guarantees and greater matching accuracy. We implement the protocol and demonstrate the feasibility of this approach in linking medium sized patient databases with tens of thousands of records.
To View the Abstract Contents
Now it is Your Time to Shine.
Great careers Start Here.
We Guide you to Every Step
Success! You're Awesome
Thank you for filling out your information!
We’ve sent you an email with your Final Year Project PPT file download link at the email address you provided. Please enjoy, and let us know if there’s anything else we can help you with.
To know more details Call 900 31 31 555
The WISEN Team