Privacy preserving record linkage using homomorphic encryption
Sean M. Randall, Adrian Paul Brown, Anna M. Ferrante, James Boyd, James Bernard Semmens · Figshare · 2015
The bloom filter method for privacy preserving record linkage [24] has been shown to be both efficient, and provide equivalent linkage quality to that achievable with unencoded identifiers [23]. However in some situations, the bloom filter method may be vulnerable to frequency attacks, which could potentially leak identifying information [18]. In this paper we extend the bloom filter protocol to include a homomorphic encryption step which removes the vulnerability to frequency attacks. We evaluate our method by conducting a de-duplication of emergency presentation data.