A formalization of re-identification in terms of compatible probabilities

2013/01/21 by Vicenç Torra, Torra, Vicenç, Klara Stokes +1
Computer Science · Mathematics · #Artificial Intelligence (cs.AI) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.AI #cs.CR #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1301.5022

arxiv created 2013/01/21 · arxiv updated 2013/01/23

Abstract

Re-identification algorithms are used in data privacy to measure disclosure risk. They model the situation in which an adversary attacks a published database by means of linking the information of this adversary with the database. In this paper we formalize this type of algorithm in terms of true probabilities and compatible belief functions. The purpose of this work is to leave aside as re-identification algorithms those algorithms that do not satisfy a minimum requirement.

Related

• Practical and Ready-to-Use Methodology to Assess the re-identification Risk in Anonymized Datasets
• Measuring Re-identification Risk
• Assessing the risk of re-identification arising from an attack on anonymised data
• An Improved Bound for Security in an Identity Disclosure Problem
• Unifying Re-Identification, Attribute Inference, and Data Reconstruction Risks in Differential Privacy