# US 2024/0005035 A1 · Method for evaluating the risk of re-identification of anonymised data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0005035 A1
- Document ID: US20240005035A1
- Status: Published application
- Kind: A1
- Application number: 18/030,545
- Filed: 2021-10-07
- Published: 2024-01-04
- Earliest claimed: 2020-10-07
- Assignees: Big Data Sante
- Applicants: Big Data Sante
- Inventors: Morgan GUILLAUDEUX; Olivier BREILLACQ
- Web page: https://patentgrep.com/patent/US20240005035A1

## CPC

- G06F 21/6245: {Protecting personal data, e.g. for financial or medical purposes}
- G06F 21/54: by adding security routines or objects to programs
- G06F 21/575: {Secure boot}
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/6254: {by anonymising data, e.g. decorrelating personal data from the owner's identification}
- G06N 3/045: Combinations of networks
- G06N 3/0455: Auto-encoder networks; Encoder-decoder networks
- G06N 3/088: Non-supervised learning, e.g. competitive learning
- G06N 20/00: Machine learning
- H04W 12/02: Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
- H04L 2209/42: Anonymization, e.g. involving pseudonyms
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The method delivers a degree of protection (txP3) representative of the risk of re-identification of data in the case of a correspondence search attack including a deterministic search based on an external information source and a correspondence search based on a distance. The method comprises steps of E) consolidating a set of original individuals (EDO) and a set of anonymous individuals (IA); F) identifying, in the set of original individuals, individuals at risk (IOrs) via the deterministic correspondence search; G) evaluating a degree of failure of re-identification (txP1) for the sets of original individuals and of anonymous individuals, on the basis of the correspondence search based on distance; H) computing the degree of protection as a function of a total number of individuals in the original dataset, of a number (RS) of individuals at risk identified in step B) and of the degree of failure of re-identification (txP1).

## Claims

### Claim 1

A computer-implemented data processing method for evaluating a risk of re-identification of anonymized data, said method delivering a degree of protection (txP3) representative of said risk of re-identification in the case of a correspondence search attack including a deterministic search based on at least one external information source and a correspondence search based on a distance, said method comprising the steps of E) consolidating an original dataset (EDO) comprising a plurality of original individuals (IO) and an anonymized dataset (EDA) comprising a plurality of anonymous individuals (IA), said anonymous individuals (IA) being produced by a process of anonymizing said original individuals (IO); F) identifying, in said original dataset (EDO), original individuals at risk (IOrs) as being original individuals (IO) having at least one noteworthy, or unique, value in at least one considered variable, or at least one combination of noteworthy, or unique, values in a set of considered variables, in a deterministic correspondence search and to which only one respective close anonymous individual (IAprs) can be associated by said deterministic correspondence search; G) evaluating a degree of failure of re-identification (txP1) for said original datasets (EDO) and anonymized datasets (EDA), from said correspondence search based on a distance between each of said original individuals (IO) and one or more of the nearest of said anonymous individuals (IA) identified by a method called “k-NN” method; H) computing said degree of protection (txP3) as a function of a total number (M) of original individuals (IO) in said original dataset (EDO), of a number (RS) of original individuals at risk (IOrs) identified in step B) and of said degree of failure of re-identification (txP1) obtained in step G).

### Claim 2 (depends on 1)

The method according to claim 1, characterized in that, in step F), an anonymous individual (IA) is considered to be one of said nearest anonymous individuals (IAp, IAprs) of one of said considered individuals at risk (IOrs) when 1) said anonymous individual (IA) has a variable with the same modality as a considered variable of said original individual at risk (IOrs) in said correspondence search in the case wherein said variable is a qualitative variable, or when 2) said anonymous individual has a value for said considered variable that is equal to a tolerance range close to the value of said same considered variable of said original individual at risk (IOrs) in the case wherein said considered variable in said deterministic correspondence search is a continuous variable.

### Claim 3 (depends on 1)

The method according to claim 1, characterized in that step G) comprises the sub-steps of a) linking said original dataset (EDO) to said anonymized dataset (EDA); b) converting (PCA, MCA, FAMD) said original individuals (IO) and said anonymous individuals (IA) in a Euclidean space (A1, A2), with said original individuals (IO) and anonymous individuals (IA) being represented by coordinates in said Euclidean space (A1, A2); c) identifying, for each of said original individuals (IO), one or more of said nearest anonymous individuals (IA) based on said distance, using the “k-NN” method; and d) computing said degree of failure of re-identification (txP1) as being a percentage of cases where one of said nearest anonymous individuals (IAk) identified in sub-step c) for one of said original individuals (IOi) is not a valid anonymous individual (IAi) corresponding to said original individual (IOi).

### Claim 4 (depends on 3)

The method according to claim 3, characterized in that said distance is a Euclidean distance.

### Claim 5 (depends on 3)

The method according to claim 3, characterized in that the transformation of sub-step b) is carried out by a factor method (PCA, MCA, FAMD) and/or using an artificial neural network, called “autoencoder”.

### Claim 6 (depends on 5)

The method according to claim 5, characterized in that said factor method is a “Principal Component Analysis” (PCA) method when said individuals (IO, IA) comprise continuous type variables, a “Multiple Correspondence Analysis” (MCA) method when said individuals (IO, IA) comprise qualitative type variables, or a “Factor Analysis of Mixed Data” (FAMD) method when said individuals (IO, IA) comprise “continuous/qualitative” type variables.

### Claim 7 (depends on 1)

A data anonymization computer system (SAD) including a data storage device (SD) storing program instructions (MET) for implementing the method according to claim 1.

### Claim 8 (depends on 1)

A computer program product including a medium in which program instructions (MET) are recorded that are readable by a processor for implementing the method according to claim 1.
