Patent ID: 9729548
Date: 2017-08-08
CPC Classifications: G06K,G09C,H04L

Claim:
1. An identification process of an individual or object (I), in a system comprising a control server (SC) and a management server (SG) of a database (DB) comprising N indexed reference data (b i ) of N stored individuals, each of the datum (b) of the individual (I) and the reference data (b i ) comprising a set of n indexed bits, the process comprising steps during which: the control server (SC) acquires ( the control server (SC) and the management server (SG) convert ( the control server (SC) determines ( the garbled circuit having for inputs a set of encryption keys of all the bits of the simplified data (s the function to be evaluated being the calculation of the rates of similarities between the simplified data (s the management server (SG) scrambles ( from the p scrambled data (b′ in which each step of secure multi-party computation comprises the following sub-steps: the management server (SG) generates at least one garbled circuit (C) for computation of a function (f) to be evaluated, each garbled circuit (C) having for inputs a set of encryption keys of bits of input data of the function (f) to be evaluated and for output the encryption keys corresponding to the bits of the result of the evaluated function (f), and comprising: the computation steps of the function (f) decomposed in the form of elementary logical operations, and a set of coding keys (k) of each of the possible inputs and outputs of each elementary logical operation, the management server (SG) randomly generates said coding keys (k), the management server (SG) communicates to the control server (SC), using an oblivious transfer technique, for each garbled circuit (C), coding keys (k) corresponding to the values of the bits of the inputs of the function (f) to be evaluated, and decoding table (T) of the output of each garbled circuit (C) or of one or more outputs of a logical operation of the latter, and from the keys (k) obtained, the control server (SC) evaluates each garbled circuit (C) using the keys obtained as input, and in which: for scrambling the N data of the base, the management server generates, for each of the p reference data corresponding to the simplified data selected, a corresponding scrambled database comprising N scrambled data for which, for each possible position of a bit in the binary representation of the corresponding data, a random permutation is applied to the bit of said position, and the generation of the coding keys (k′) of a scrambled datum (b′