A Constraint Satisfaction Cryptanalysis of Bloom Filters in Private Record Linkage

By Mehmet Kuzu, Murat Kantarcioglu, Elizabeth Durham, Bradley A. Malin. 2011

121 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Management Science and Operations Research

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Management Science and Operations Research

Citations in the corpus

Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption (2017, background): “Hence the longer dataset is truncated, excluding only non-matched entities.2 1While CLKs are robust to typographical errors, they are susceptible to cryptanalytic attacks if insecure parameters are used, or if too few identifiers are hashed [Kuzu et al., 2011, 2013, Niedermeyer et al., 2014].”
A practical approach to achieve private medical record linkage in light of public resources (2013, methodology): “To do so, he invokes a public resource as a global dataset and attempts to infer the identi ers in the BFE datasets through a CSP.”
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage (2014, methodology): “Hence, in their second paper, Kuzu et al. [12] took a more critical look at the practical use of their own attack for real-world data sets, because the distribution of personal identifiers such as those from a medical database is unlikely to generate a random sample.”
"Better Than Nothing" Privacy with Bloom Filters: To What Extent? (2012, background): “An attack devised to revert privacy has been described in [25].”
Data Matching (2012, methodology): “More recently, several researchers have investigated the use of Bloom filters [39] to conduct approximate matching within a privacy-preserving framework [98, 173, 239].”
A Novel Error-Tolerant Anonymous Linking Code (2011, background): “The favourable reception of the paper [14-16] as well as practical need in the course of the establishment of a German Mortality Register made us thinking about whether our idea could possibly used to build an encrypted key for linking patient data to epidemiological registers.”
Efficient two-party private blocking based on sorted nearest neighborhood clustering (2013, background): “There have been several attack models proposed to investigate the risk of disclosure in PPRL solutions [20, 22, 28].”
A taxonomy of privacy-preserving record linkage techniques (2013, methodology): “[122] recently showed, depending upon the number of hash functions employed and the number of bits in a Bloom filter, using a constrained satisfaction solver allows the iterative mapping of individual encoded values back to their original values.”