Abstract: A server-implemented method encrypting at least two pieces of indexed data as lists of elements, each element belonging to a finite set of indexed symbols on an alphabet. The data is encrypted to form a protected set, including: the server randomly generates, for each datum, a corresponding encoding function; if at least one element that constitutes a datum is the symbol of the alphabet, the server determines the image of the symbol of the alphabet via the encoding function corresponding to the datum to obtain a codeword coordinate and adds the codeword coordinate to an indexed set corresponding to the element of the alphabet; then the server completes the indexed set with error-inducing points; the server randomly reindexes the elements of the indexed set corresponding to the symbol of the alphabet; and the server adds the indexed set to the protected set. The method can identify an individual.

Abstract: The invention is about an identification process of an individual or object, in a system comprising a control server and a management server of a database comprising N indexed data of N stored individuals, in which, to identify the individual or object, its datum is compared to each of the N data of the base.

Abstract: Biometric data relating to a biological part are processed by obtaining, on the one hand, a first set of transformed biometric data (f(B1)) by applying at least one irreversible transformation to a first set of biometric data (B1), and, on the other hand, a second set of transformed biometric data (f(B2)) by applying said transformation to a second set of biometric data (B2). Thereafter, a decision is made as to whether the second biometric data set corresponds to the first biometric data set on the basis of a comparison between the first transformed biometric data set and the second transformed biometric data set, said comparison being performed at the bit level of a digital representation of said first and second transformed biometric data sets as a function of an error corrector code word.

Abstract: In a method for searching for an entity belonging to a set of entities, a verifier device and the entities are arranged so as to exchange information via at least one communication channel. Each entity has a first respective identifier from which a plurality of representatives can be obtained. According to the method, a first identification word (mi; p(Xi)), which is related to an entity for which a search is carried out, is obtained in the verifier device. The first identification word is formed by applying a first encoding function to the first identifier of the entity for which the search is being carried out so as to depend on a sub-portion of the plurality of representatives that can be obtained from said first identifier. The sub-portion is predetermined by at least one variable parameter. The first identification word, obtained on the communication channel, is transmitted from the verifier device.

Abstract: The invention relates to a method and system for managing and checking different identity data relating to a person. According to the invention, a derived-identity management server generates for the person at least part of the identity data with which said person can be authenticated in relation to a service provider for the derived-identity domain, on the basis of information derived from identity data from parent domains. The identity data generation processing ensures that no link can be established from two authentications in two separate domains in the absence of link information. If necessary, said link information is transmitted by a parent domain to a derived-identity server so that the latter establishes the link between the identity data of the derived-identity domain and the identity data of the parent domain, e.g. for the cascade revocation of a person from various domains.

Abstract: A database comprising biometric data stored in encrypted form is managed by a management unit. It comprises a set of filters respectively associated with filter identifiers. A biometric data item is received at a management unit; next, said biometric data item is stored in an encrypted form at a given address in the database. Then keywords are obtained on the basis of a first set of hash functions and of the biometric data item. A subset of indexing filters is associated with each keyword by selecting, for each keyword, filters as a function of the respectively associated filter identifiers, of said keywords, and of a second set of hash functions; and the given address is associated with each of the filters of the subset of filters.

Abstract: The invention relates to a registration method for future biometric verification purposes, including the following steps for one person (I): obtaining first biometric data (4) and second biometric data (5) relating to said person; obtaining alphanumerical data (a) including at least one identifier relating to said person; storing, in a first biometric database (1), the thus-obtained first biometric data in association with a decryption key (6); storing, in a correspondence table (T), first information from the thus-obtained second biometric data and alphanumerical data in correspondence with an index (j); storing, in a second database (2), second information from the thus-obtained second biometric data and alphanumerical data in association with a version (J) of said index that is encrypted with an encryption key corresponding to said decryption key, said second information being different from the first information.

Abstract: A cryptographic calculation is executed in an electronic component, according to a cryptographic algorithm including at least one application of a one-way function which is disabled upon an intrusion into the electronic component. The one-way function is based on a first affine operation corresponding to a first secret key. The one-way function is applied, by obtaining (11) first and second random values (r, r?), then, by obtaining a first result (13) by applying a second affine operation (?K1), which corresponds to a second secret key, to a first combination (12) of the first and second random values, and, by obtaining (14) thereafter a second result by applying a third affine operation (?K2) which corresponds to a third secret key to said first result.

Abstract: In a control system comprising control device adapted for, on the one hand, receiving signal indicating a first biometric datum (W), and, on the other hand, obtaining a second biometric datum captured (w?), at the level of the control device, the first and second biometric date are compared. Next, it is decided whether the first and second biometric data correspond on the basis of the comparison. Thereafter, at least a secret cryptographic key part (H(w)) is generated by applying cryptographic function to the first biometric datum.

Abstract: A control entity communicates with an entity to be controlled so as to effect a control, a secret key being associated with the control entity. These entities share public parameters, a second public parameter being a combination of a first public parameter of the said plurality with the secret key. At the level of the entity to be controlled, a random value is generated, a first message is transmitted to the control entity, this first message comprising at least one value obtained by combining the first public parameter with the random value; and a second message is transmitted to the control entity, this second message comprising at least one value obtained by combining the first random value, a secret key of the entity to be controlled and a value received from the control entity. One of the values included in the first or the second message is based on the second public parameter.

Abstract: Techniques for associating an electronic identifier of a user equipment (UE) with a user of the UE are described. In embodiments of an apparatus, system, method, and computer program of the present disclosure, a UE may transmit an electronic identifier associated with the UE via peer discovery, for receiving by a second UE. A perceivable cue associated with the electronic identifier may be indicated to a second user. The UE or the user of the UE may indicate the perceivable cue to the second user. Selection of the perceivable cue by the second user may cause the initiation of communications between the UE and the second UE.

Abstract: Additional information regarding a fingerprint is estimated, with a given level of confidence, on the basis of characteristics of a set of minutiae corresponding to this print. Local descriptors are determined around some at least of the minutiae, so that they comprise, in relation to zones comprising additional information estimated with the given confidence level, values calculated on the basis of said information and, in relation to zones not comprising such information, erasures. The local descriptors determined are quantized according to a given number of integer values, a value being reserved for erasures. The quantized local descriptors are coded with the aid of an error-tolerant coding algorithm associated with a decoding algorithm devised to take account of errors and erasures. And a pseudo-identity is determined on the basis of some at least of the coded quantized local descriptors.

Abstract: The invention relates in particular to a method for securing the execution of a cryptographic algorithm (ALG) against passive sniffing, the method implementing masking (MSK) of data processed by the cryptographic algorithm. The masking (MSK) of said data includes a linear encoding step such as x?=x.L+c, in which x is the data to be masked, x? is the corresponding masked data, c is a code word included in a linear code C, and L is a matrix made up of linearly independent vectors not included in the linear code C. The invention also relates to a device (SC) implementing such a method.

Abstract: The invention concerns a biometric system provided with a set of reference biometric data (B?i) resulting from the application of a disjunction between a first set of biometric data (Bi) and a first encoded key (Ki), and from an information concerning the first key. A second set of biometric data (B2) is obtained. A second encoded key is determined by using a disjunction between the set of reference biometric data and the second set of biometric data. The second key is decoded by iterative decoding. Then, it is determined whether the first and second sets of biometric data mutually correspond by comparing the information concerning the first key with the second key.

Abstract: A database stores a number N of biometric data representatives which correspond to a set of characteristics of said biometric data. Acquired biometric data is obtained. Then, transformed biometric data is obtained by transforming the acquired biometric data according to said set of characteristics. Next, N deviation values are obtained by applying a comparison between the transformed biometric data and the N representatives in the database. Finally, a vector representing the acquired biometric data is obtained, the representation vector having a number of components less than or equal to N, said components being determined in relation to said N deviation values.

Abstract: The invention relates to a database (10) suitable for combining biometric data (b) and an identifier (Id(b)). For this purpose, biometric data (bref) are collected (101). Next, a plurality of keywords is generated (102) by means of applying a family (H) of hash functions to the biometric data. Then, a plurality of addresses (@i) is obtained (103) by means of applying an addressing function (F) to the plurality of keywords and to a secret key. Finally, the identifier is stored (104) at said plurality of addresses.

Abstract: A method of identifying an individual in which captured images are encrypted by a transformation function and superimposed over previously recorded encrypted images. The superimposition image thus formed is used for identity verification. If the verification is negative a looping step repeats the process until positive verification is achieved.

Abstract: In a method for searching for an entity belonging to a set of entities, a verifier device and the entities are arranged so as to exchange information via at least one communication channel. Each entity has a first respective identifier from which a plurality of representatives can be obtained. According to the method, a first identification word (mi; p(Xi)), which is related to an entity for which a search is carried out, is obtained in the verifier device. The first identification word is formed by applying a first encoding function to the first identifier of the entity for which the search is being carried out so as to depend on a sub-portion of the plurality of representatives that can be obtained from said first identifier. The sub-portion is predetermined by at least one variable parameter. The first identification word, obtained on the communication channel, is transmitted from the verifier device.

Abstract: The invention relates to equipment for the identification of an individual by capture of body imprint images and of the underlying venous network, comprising: a prismatic optical element having: a large side for apposition of a body zone; a first inclined lateral side receiving a first radiation having a first wave length emitted by a first lighting means to light the large side with total reflection; a second inclined lateral side facing a first sensor receiving the first reflected radiation carrying an image of the body imprint; and a small side receiving a second radiation having a second wave length emitted by second lighting means, perpendicularly reaching the apposition zone and penetrating the body zone, and which faces a second sensor receiving the second reflected radiation carrying an image of the underlying venous network.

Abstract: A cryptographic calculation is executed in an electronic component, according to a cryptographic algorithm including at least one application of a one-way function which is disabled upon an intrusion into the electronic component. The one-way function is based on a first affine operation corresponding to a first secret key. The one-way function is applied, by obtaining (11) first and second random values (r, r?), then, by obtaining a first result (13) by applying a second affine operation (?K1), which corresponds to a second secret key, to a first combination (12) of the first and second random values, and, by obtaining (14) thereafter a second result by applying a third affine operation (OK2), which corresponds to a third secret key, to said first result.