# US 2023/0068650 A1 · Method for testing if a data element belongs to a list of reference data elements

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

- Number: US 2023/0068650 A1
- Document ID: US20230068650A1
- Status: Published application
- Kind: A1
- Application number: 17/798,945
- Filed: 2021-02-10
- Published: 2023-03-02
- Earliest claimed: 2020-02-25
- Assignees: Thales Dis France SAS
- Applicants: Thales Dis France SAS
- Inventors: Aline GOUGET
- Web page: https://patentgrep.com/patent/US20230068650A1

## CPC

- H04L 9/008: {involving homomorphic encryption}
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/62: Protecting access to data via a platform, e.g. using keys or access control rules
- H04L 2209/76: Proxy, i.e. using intermediary entity to perform cryptographic operations
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Provided is a method for testing if a candidate data element, belongs to a list of reference data elements, performed by a client device (102) and comprising the steps of generating an encrypted candidate data element (y′) by encrypting said candidate data element (x′) with a leveled fully homomorphic encryption scheme, transmitting said encrypted candidate data element (y′) to a server device (103), storing said reference data elements (xi) receiving, from said server device, a delta value depending on a product of differences, decrypting said delta value with said leveled fully homomorphic encryption scheme, based on said decrypted delta value, determining whether said candidate data element (x′) belongs to said list of reference data elements (xi). Other embodiments disclosed.

## Claims

### Claim 1

A method for testing if a data element (x′), called candidate data element, belongs to a list of reference data elements (xi), performed by a client device (102) and comprising the steps of:
generating (SC1) an encrypted candidate data element (y′) by encrypting said candidate data element (x′) with a leveled fully homomorphic DGHV (Dijik, Gentry, Halevi, Vaikuntanathan) encryption scheme,
transmitting (SC2) said encrypted candidate data element (y′) to a server device (103) storing said reference data elements (xi) encrypted with said leveled fully homomorphic DGHV encryption scheme, called encrypted reference data elements (yi),
receiving (SC3), from said server device (103), a delta value depending on a product of differences between said encrypted candidate data element (y′) and each of said encrypted reference data elements (yi),
decrypting (SC4) said delta value with said leveled fully homomorphic DGHV encryption scheme,
based on said decrypted delta value, determining (SC5) whether said candidate data element (x′) belongs to said list of reference data elements (xi), said leveled fully homomorphic DGHV encryption scheme being such that a ciphertext yi of a data xi in [0; n[, i, n being integers, FHE (Fully homomorphic Encryption) encrypted with a FHE secret key p, is equal to qi·p+n·ri+xi where qi and ri are random integers, and such that the ciphertext yi is decrypted by computing xi=(yi mod p) mod n.

### Claim 2

A method for testing if a data element (x′), called candidate data element, belongs to a list of reference data elements (xi), said method being performed by a server device (103) storing said reference data elements (xi) encrypted with a leveled fully homomorphic DGHV (Dijik, Gentry, Halevi, Vaikuntanathan) encryption scheme, called encrypted reference data elements (yi), and comprising the steps of:
receiving (ST1), from a client device (102), an encrypted candidate data element (y′) obtained by encryption of said candidate data element (x′) with said leveled fully homomorphic DGHV encryption scheme,
computing (ST2) a delta value (z) depending on a product of differences between said encrypted candidate data element (y′) and each of said encrypted reference data elements (yi),
transmitting (ST3) said computed delta value (z) to said client device (102),
such that, after decrypting of said delta value with said leveled fully homomorphic DGHV encryption scheme, the client device (102) is able to determine whether said candidate data element (x′) belongs to said list of reference data elements (xi), based on said decrypted delta value,
said leveled fully homomorphic DGHV encryption scheme being such that a ciphertext yi of a data xi in [0; n[, i, n being integers, FHE (Fully homomorphic Encryption) encrypted with a FHE secret key p, is equal to qi·p+n·ri+xi where qi and ri are random integers, and such that the ciphertext yi is decrypted by computing xi=(yi mod p) mod n.

### Claim 3 (depends on 2)

The method of claim 2 wherein:
said delta value z equals to (y1−y)*(y2−y) . . . (yt−y′) or equals to (y1−y)*(y2−y′) . . . (yt−y′) modulo y0 where y0=p*q0+r0*n with |q0|>|qi|, with y1, . . . , yT said encrypted reference data elements and y′ said encrypted candidate data element, with T an integer and 1≤i≤T,
determining whether said candidate data element (x′) belongs to said list of reference data elements (xi) comprises comparing said decrypted delta value with 0 and, when said decrypted delta value is different from 0, then said candidate data element (x′) does not belong to the list of reference data elements (xi), and when said decrypted delta value is equal to 0, said candidate data element (x′) belongs to the list of reference data elements (xi).

### Claim 4 (depends on 3)

The method of claim 3, wherein said reference data elements (xi) are plaintext data or hashes of plaintext data.

### Claim 5 (depends on 4)

The method of claim 4, wherein said reference data element (xi) are IBANs (International Bank Account Number) or hashes of IBANs.

### Claim 6 (depends on 5)

The method of claim 5, wherein a computer program product is directly loadable into a memory of at least one computer, comprising software code instructions for performing the method steps when said product is run on the computer.

### Claim 7 (depends on 5)

The method of claim 5, wherein a client device (102) comprising a processor (201) and an interface (207) is configured to perform the method steps.

### Claim 8 (depends on 5)

The method of claim 5, wherein a server device (103) comprising a memory (303, 304, 305) storing reference data elements (xi) encrypted with a leveled fully homomorphic DGHV (Dijik, Gentry, Halevi, Vaikuntanathan) encryption scheme, a processor (301) and an interface (307) is configured to perform the method steps.

### Claim 9

A system (100) comprising
a client device (102) comprising a processor and an interface configured to perform the method steps of:
generating (SC1) an encrypted candidate data element (y′) by encrypting said candidate data element (x′) with a leveled fully homomorphic DGHV (Dijik, Gentry, Halevi, Vaikuntanathan) encryption scheme,
transmitting (SC2) said encrypted candidate data element (y′) to a server device (103) storing said reference data elements (xi) encrypted with said leveled fully homomorphic DGHV encryption scheme, called encrypted reference data elements (yi),
receiving (SC3), from said server device (103), a delta value depending on a product of differences between said encrypted candidate data element (y′) and each of said encrypted reference data elements (yi),
decrypting (SC4) said delta value with said leveled fully homomorphic DGHV encryption scheme,
based on said decrypted delta value, determining (SC5) whether said candidate data element (x′) belongs to said list of reference data elements (xi), said leveled fully homomorphic DGHV encryption scheme being such that a ciphertext yi of a data xi in [0; n[, i, n being integers, FHE (Fully homomorphic Encryption) encrypted with a FHE secret key p, is equal to qi·p+n·ri+xi where ci and ri are random integers, and such that the ciphertext yi is decrypted by computing xi=(yi mod p) mod n.
and,
a server device (103) configured to perform the method steps of:
said delta value z equals to (y1−y)*(y2−y′) . . . (yt−y′) or equals to (y1−y)*(y2−y′) . . . (yt−y′) modulo y0 where y0=p*q0+r0*n with |q0|>|qi|, with said encrypted reference data elements and y′ said encrypted candidate data element, with T an integer and 1≤i≤T,
determining whether said candidate data element (x′) belongs to said list of reference data elements (xi) comprises comparing said decrypted delta value with 0 and, when said decrypted delta value is different from 0, then said candidate data element (x′) does not belong to the list of reference data elements (xi), and when said decrypted delta value is equal to 0, said candidate data element (x′) belongs to the list of reference data elements (xi).

### Claim 10 (depends on 1)

The method of claim 1, wherein:
said delta value z equals to (y1−y)*(y2−y) . . . (yt−y′) or equals to (y1−y)*(y2−y) . . . (yt−y′) modulo y0 where y0=p*q0+r0*n with |q0|>|qi|, with y1, . . . , yT said encrypted reference data elements and y′ said encrypted candidate data element, with T an integer and 1≤i≤T,
determining whether said candidate data element (x′) belongs to said list of reference data elements (xi) comprises comparing said decrypted delta value with 0 and, when said decrypted delta value is different from 0, then said candidate data element (x′) does not belong to the list of reference data elements (xi), and when said decrypted delta value is equal to 0, said candidate data element (x′) belongs to the list of reference data elements (xi).

### Claim 11 (depends on 10)

The method of claim 10, wherein said reference data elements (xi) are plaintext data or hashes of plaintext data.

### Claim 12 (depends on 11)

The method of claim 11, wherein said reference data element (xi) are IBANs (International Bank Account Number) or hashes of IBANs.
