IP Library Granted Patent US 12,373,597
Granted Patent B2
US 12,373,597 · App. 17/815,800 · Granted Jul 29, 2025

Method and system for processing personal data

Inventors: Vincent Despiegel (Courbevoie, FR); Hervé Chabanne (Courbevoie, FR)
Assignee: IDEMIA IDENTITY & SECURITY FRANCE
G06F21/6245H04L9/008H04L9/3231
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,373,597
App. No.
17/815,800
Granted
Jul 29, 2025
Kind
B2
Abstract

A method for processing personal data, comprising the steps of: (a) For each reference personal data of a reference personal database, calculating in the encrypted domain a similarity rate of the reference personal data with a candidate personal data; said reference personal database being associated with a first partition into a plurality of first sets of reference personal data, and with a second partition into a plurality of second sets of reference personal data, such that each reference personal data of a reference personal database belongs to a single first set and a single second set; (b) For each first set and each second set, calculating an overall similarity rate of said set based on the similarity rates of the reference personal data of said set; (c) Comparing each overall similarity rate of a first and second set with a first and second predetermined threshold, respectively.

Claims (30)

1. A method for processing personal data, comprising the carrying out by a system of steps of:

(a) For each reference personal data of a reference personal database, calculating in the encrypted domain a similarity rate of the reference personal data with a candidate personal data; said reference personal database being associated with a first partition into a plurality of first sets of reference personal data, and with a second partition into a plurality of second sets of reference personal data, such that each reference personal data of a reference personal database belongs to a single first set and a single second set;

(b) For each first set and each second set, calculating in the encrypted domain an overall similarity rate of said set based on the similarity rates of the reference personal data of said set;

(c) Comparing in the encrypted domain each overall similarity rate of a first set with a first predetermined threshold, and each overall similarity rate of a second set with a second predetermined threshold;

wherein the candidate personal data and/or each reference personal data is encrypted in a homomorphic way.

2. The method according to claim 1 , wherein step (b) comprises applying a strictly convex function to the similarity rates of the reference personal data.

3. The method according to claim 2 , wherein said strictly convex function is a power function of order greater than 1.

4. The method according to claim 2 , wherein the overall similarity rate of a set is calculated in step (b) as the sum of the similarity rates of the reference personal data of said set after applying said strictly convex function.

5. The method according to claim 1 , wherein the first and second partitions are such that each second set contains a single reference data from each first set.

6. The method according to claim 5 , wherein said reference personal database contains m*n reference personal data, with m and n two integers, and there are n first sets of m reference personal data and m second sets of n reference personal data, such that for any j≤n, the j-th second set contains the j-th reference personal data of each first set.

7. The method according to claim 1 , wherein said personal data are biometric data.

8. The method according to claim 1 , wherein said similarity rate of two personal data is calculated in step (a) as the scalar product of these personal data.

9. The method according to claim 1 , wherein step (a) comprises, for each reference personal data, calculating in the encrypted domain a similarity rate of the reference personal data with a sum of at least two candidate personal data.

10. The method according to claim 1 , comprising a step (d) of identifying at least one reference personal data belonging to both a first set with an overall similarity rate higher than said first threshold and a second set with an overall similarity rate higher than said second threshold.

11. A biometric data processing system, wherein said biometric data processing system is configured for the carrying out of steps of:

(a) For each reference personal data of a reference personal database, calculating in the encrypted domain a similarity rate of the reference personal data with a candidate personal data; said reference personal database being associated with a first partition into a plurality of first sets of reference personal data, and with a second partition into a plurality of second sets of reference personal data, such that each reference personal data of a reference personal database belongs to a single first set and a single second set;

(b) For each first set and each second set, calculating an overall similarity rate of said set based on the similarity rates of the reference personal data of said set;

(c) Comparing each overall similarity rate of a first set with a first predetermined threshold, and each overall similarity rate of a second set with a second predetermined threshold;

wherein the candidate personal data and/or each reference personal data is encrypted in a homomorphic way.

12. A non-transitory computer program product comprising code instructions which, when executed by a processor, cause the processor to perform a method comprising the steps of:

(a) For each reference personal data of a reference personal database, calculating in the encrypted domain a similarity rate of the reference personal data with a candidate personal data; said reference personal database being associated with a first partition into a plurality of first sets of reference personal data, and with a second partition into a plurality of second sets of reference personal data, such that each reference personal data of a reference personal database belongs to a single first set and a single second set;

(b) For each first set and each second set, calculating in the encrypted domain an overall similarity rate of said set based on the similarity rates of the reference personal data of said set;

(c) Comparing in the encrypted domain each overall similarity rate of a first set with a first predetermined threshold, and each overall similarity rate of a second set with a second predetermined threshold;

wherein the candidate personal data and/or each reference personal data is encrypted in a homomorphic way;

wherein said method is executed on a computer.

13. A storage means readable by computer equipment on which a computer program product comprises code instructions for the execution of a method comprising the steps of:

(a) For each reference personal data of a reference personal database, calculating in the encrypted domain a similarity rate of the reference personal data with a candidate personal data; said reference personal database being associated with a first partition into a plurality of first sets of reference personal data, and with a second partition into a plurality of second sets of reference personal data, such that each reference personal data of a reference personal database belongs to a single first set and a single second set;

(b) For each first set and each second set, calculating in the encrypted domain an overall similarity rate of said set based on the similarity rates of the reference personal data of said set;

(c) Comparing in the encrypted domain each overall similarity rate of a first set with a first predetermined threshold, and each overall similarity rate of a second set with a second predetermined threshold;

wherein the candidate personal data and/or each reference personal data is encrypted in a homomorphic way.

Assignments (4)
CORRECTIVE ASSIGNMENT TO CORRECT THE PATENT NUMBER REPLACING 10158873 WITH 10185873 PREVIOUSLY RECORDED ON REEL 71930 FRAME 625. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT . Recorded Apr 1, 2026
From: IDEMIA IDENTITY & SECURITY FRANCE
To: IDEMIA PUBLIC SECURITY FRANCE
Reel/Frame 075530/0067 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 14, 2025
From: IDEMIA IDENTITY & SECURITY FRANCE
To: IDEMIA PUBLIC SECURITY FRANCE
Reel/Frame 071930/0625 →
CORRECTIVE ASSIGNMENT TO CORRECT THE RECEIVING PARTY NAME PREVIOUSLY RECORDED AT REEL: 60661 FRAME: 850. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jul 2, 2025
From: CHABANNE, HERVE; DESPIEGEL, VINCENT
To: IDEMIA IDENTITY & SECURITY FRANCE
Reel/Frame 071786/0343 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 28, 2022
From: CHABANNE, HERVE; DESPIEGEL, VINCENT
To: IDEMIA IDENTITY & SECURITY IFRANCE
Reel/Frame 060661/0850 →
Continuity (1)
Related Publication 20230033479A1 · Feb 2, 2023
References Cited (36)
US 5253327A · Yoshihara · 1993 [cited by examiner]
US 8515058B1 · Gentry · 2013 [cited by applicant]
US 10474899B2 · Jalan · 2019 [cited by examiner]
US 10726235B2 · Che · 2020 [cited by examiner]
US 11277258B1 · Zhang · 2022 [cited by examiner]
US 11301586B1 · Poh · 2022 [cited by examiner]
US 11495041B2 · Derakhshani · 2022 [cited by examiner]
US 11527107B1 · Mostafa · 2022 [cited by examiner]
US 20090006855A1 · Tuyls · 2009 [cited by examiner]
US 20140133710A1 · Hama · 2014 [cited by examiner]
US 20170293823A1 · Furihata · 2017 [cited by examiner]
US 20190026655A1 · Xie · 2019 [cited by examiner]
US 20190163951A1 · Chang · 2019 [cited by examiner]
US 20190318073A1 · Lee · 2019 [cited by examiner]
US 20190363870A1 · Wagner · 2019 [cited by examiner]
US 20200004939A1 · Streit · 2020 [cited by examiner]
US 20200228341A1 · Mohassel · 2020 [cited by examiner]
US 20200250807A1 · Hong · 2020 [cited by examiner]
US 20210124815A1 · Rindal · 2021 [cited by examiner]
US 20210211290A1 · Jindal · 2021 [cited by examiner]
US 20210280322A1 · Frank · 2021 [cited by examiner]
US 20210365532A1 · Engelsma · 2021 [cited by examiner]
US 20220050999A1 · Zheng · 2022 [cited by examiner]
US 20220103362A1 · Chafni · 2022 [cited by examiner]
US 20220131698A1 · Badrinarayanan · 2022 [cited by examiner]
US 20220254449A1 · Van Hyfte · 2022 [cited by examiner]
US 20220277583A1 · Derckx · 2022 [cited by examiner]
US 20220375477A1 · Tan · 2022 [cited by examiner]
US 20220383663A1 · Gupta · 2022 [cited by examiner]
US 20230189895A1 · Talbot · 2023 [cited by examiner]
Chillotti et al., “TFHE: Fast Fully Homomorphic Encryption Over the Torus”, Journal of Cryptology, vol. 33, 2020, pp. 34-91. [cited by applicant]
Clet et al., “BFV, CKKS, TFHE: Which One is the Best for a Secure Neural Network Evaluation in the Cloud?”, ACNS 2021 Workshops, LNCS 12809, 2021, pp. 279-300. [cited by applicant]
Inan et al., “Sparse Combinatorial Group Testing for Low-Energy Massive Random Access”, arXiv:1711.05403v1 [cs.IT], Nov. 15, 2017, pp. 1-18. [cited by applicant]
Inan et al., “Sparse Combinatorial Group Testing”, IEEE Transactions on Information Theory, vol. 66, Issue 5, May 2020, pp. 1-24. [cited by applicant]
Kim et al., “Efficient Privacy-Preserving Fingerprint-Based Authentication System Using Fully Homomorphic Encryption”, Security and Communication Networks, vol. 2020, Article ID 4195852, Feb. 13, 2020, pp. 1-11. [cited by applicant]
Preliminary Research Report received for French Application No. 2108193, mailed on Apr. 9, 2022, 6 pages (1 page of French Translation Cover Sheet and 5 pages of original document). [cited by applicant]