A Simplified Variant of a Protocol for Privacy-preserving String Comparison

NO. WP-GRLC-2011-01

9 Pages Posted: 31 Mar 2020

See all articles by Tobias Bachteler

Tobias Bachteler

University of Duisburg-Essen

Jörg Reiher

University of Duisburg-Essen

Rainer Schnell

University of Duisburg-Essen

Date Written: July 1, 2011

Abstract

Due to the frequency of spelling and typographical errors, in practical applications, Record Linkage algorithms have to use string similarity functions. Therefore, algorithms for computing string similarity functions with encrypted identifiers are essential for approximate string matching in private record linkage. In this paper, we propose a new simplified protocol for Privacy-preserving Record Linkage.

Keywords: encryption, similarity measures, privacy-preserving record linkage

Suggested Citation

Bachteler, Tobias and Reiher, Jörg and Schnell, Rainer, A Simplified Variant of a Protocol for Privacy-preserving String Comparison (July 1, 2011). NO. WP-GRLC-2011-01 , Available at SSRN: https://ssrn.com/abstract=3549251 or http://dx.doi.org/10.2139/ssrn.3549251

Tobias Bachteler

University of Duisburg-Essen

Lotharstrasse 1
Duisburg, 47048
Germany

Jörg Reiher

University of Duisburg-Essen ( email )

Lotharstrasse 1
Duisburg, 47048
Germany

Rainer Schnell (Contact Author)

University of Duisburg-Essen ( email )

Lotharstrasse 1
Duisburg, 47048
Germany

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
27
Abstract Views
307
PlumX Metrics