Titlebook: Linking Sensitive Data; Methods and Techniqu Peter Christen,Thilina Ranbaduge,Rainer Schnell Book 2020 Springer Nature Switzerland AG 2020

敬禮

analysis in economics are performed.The two lecture notes ch.The “Stats in the Chateau” summer school was held at the CRC chateau on the campus of HEC Paris, Jouy-en-Josas, France, from August 31 to September 4, 2009. This event was organized jointly by faculty members of three French academic insti

Nebulous

HEAVY

Linking Sensitive Data Backgrounds chapter. We then introduce the topic of privacy-preserving record linkage (PPRL), and provide a formal definition. We also contrast the general record linkage process with the PPRL process and describe the additional requirements of PPRL over traditional record linkage.

inspiration

Dawdle

接觸

Building Blocks for Linking Sensitive Databe methods for phonetic encoding, statistical linkage keys, and measures that can be used to calculate similarities between two values. We conclude the chapter with a discussion about the applicability of such building blocks when they are used in the context of linking sensitive databases.

Counteract

打算

Attacking and Hardening Bloom Filter EncodingBloom filters. In this chapter we discuss the principal ideas of these attacks and describe in more detail several successful attack methods. We then describe a series of hardening techniques that aim to make Bloom filter encoding less vulnerable to such attacks.

高度

Computational Efficiency We also discuss scalability aspects when multiple (more than two) databases are to be linked, and the challenges involved when many, possibly hundreds or even thousands, of databases need to be linked.

羅盤

Empirical Evaluationbases can be linked using privacy-preserving linkage techniques, and how such a linkage exercise can be evaluated. We further describe how to use the software employed for this evaluation in Appendix B.