A Novel Error-Tolerant Anonymous Linking Code

By R. Schnell, Tobias Bachteler, Jörg Reiher. 2011

84 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Privacy & Security, Algorithms & Complexity

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 Computer Networks and Communications

In Privacy & Security

In Algorithms & Complexity

Citations in the corpus

Advances and Open Problems in Federated Learning (2019, background): “Independently of the eventual technical levy of carrying out record linkage privately [348], the task itself happens to be substantially noise prone in the real world [347] and only sparse results have addressed its impact on training models [198].”
Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption (2017, methodology): “While we think this Theorem may be useful to optimize entity resolution algorithms with the objective to learn more accurately afterwards, a question is how does our theory fits to the actual system we are using, cryptographic longterm keys, (CLKs, Schnell et al. [2011]).”
Privacy-preserving entity resolution and logistic regression on encrypted data (2017, methodology): “The CLKs are used in a fuzzy comparison function which allows us to perform an inner join on the two datasets.”
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage (2014, methodology): “Using a single Bloom filter for all identifiers The use of a single Bloom filter for storing all identifiers (Cryptographic Longterm Key, CLK ) was first suggested in 2011, [15].”
Efficient private record linkage of very large datasets (2013, background): “The resulting binary vector (typically 500-1000 elements) is a cryptographic long-term key (CLK), which can be used for linking databases (Schnell et al. 2011).”
A practical approach to achieve private medical record linkage in light of public resources (2013, unknown): “BACKGROUNDRecordlinkage ﬁ pair Record belongs to a class of matches (ie, same patient) or non-matches Various record linkage have been , 34 e 41 ranging from heuristic rules 22 42 to probabilistic models, 43 e 45 but the process is traditionally accomplished identifying attributes, such as personal…”