PROCÉDÉ DE TRAITEMENT DE DONNÉES BIOMÉTRIQUES, SYSTÈME ET PROGRAMME D'ORDINATEUR ASSOCIÉS

    公开(公告)号:EP4456477A1

    公开(公告)日:2024-10-30

    申请号:EP24168685.6

    申请日:2024-04-05

    IPC分类号: H04L9/30 H04L9/32

    摘要: Procédé de traitement de données biométriques comprenant :
    - Le chiffrement fonctionnel (E104) d'une donnée biométrique d'épreuve qui est un vecteur comprenant n composantes d'épreuve représentatives d'un trait biométrique d'un individu candidat, et au moins une autre composante d'épreuve non nulle représentative d'un premier élément de masquage,
    - L'obtention d'un score (E106) représentant une distance, entre la donnée biométrique d'épreuve et une donnée biométrique de référence, sous une forme masquée par un masque primaire, par déchiffrement fonctionnel de la donnée biométrique d'épreuve chiffrée, en utilisant une clé de déchiffrement fonctionnel pour une fonction polynomiale de degré 1 ou 2 paramétrée avec ladite donnée biométrique de référence, la donnée biométrique de référence étant un autre vecteur comprenant n composantes de référence représentatives d'un trait biométrique d'un individu de référence et au moins une autre composante de référence non nulle représentative d'un deuxième élément de masquage.

    METHOD FOR OPTIMIZING AN EXECUTION OF A GENERATION OF A CRYSTALS-DILITHIUM POST-QUANTUM SIGNATURE

    公开(公告)号:EP4422126A1

    公开(公告)日:2024-08-28

    申请号:EP23305221.6

    申请日:2023-02-21

    IPC分类号: H04L9/32 H04L9/30

    摘要: The present invention relates to a method method for optimizing the execution of the generation of a Crystals-Dilithium post-quantum digital signature σ = (c̃, z, h) of a message M with a secret key sk = (ρ, K, tr, s1, s2, t0) where ρ, K, tr are 256 bits binary values, s1 and s2 are vectors of length l, respectively k, of elements of the ring Rq whose coefficients are lower than a first predetermined value η, and t0 is a polynomial vector of length k with k, l, n and q integers, said Crystals-Dilithium post-quantum digital signature generation comprising :
    a) generating (S1) a masking vector y, of length l, of polynomials with coefficients less than a second predetermined value γ1,
    b) computing (S2) a first vector of polynomials, of length k, w = Ay, where A is a k × l matrix each of whose entries is a polynomial in the ring Rq = Zq[X]/(Xn + 1),
    c) determining (S3) a second vector of polynomials w1 and a third vector of polynomials w0, both of length k, where every polynomial coefficient wi in Ay, with i in 0, ..., k-1, is written as wi = w1i · 2γ2 + w0i where |w0i| ≤ γ2 with γ2 a third predetermined value,
    d) generating (S4) a challenge c based on the message and the second vector of polynomials w1,
    e) performing rejection tests (S5) comprising testing if test vectors generated from said vectors, said challenge and said secret key fulfill predetermined conditions, and when said conditions are not fulfilled, restarting the signature generation from step a), else generating said signature, the steps a), b), c), d), and e) being repeated until the conditions are satisfied,
    wherein performing rejection tests (S5) comprises :
    - following said determination of said third vector of polynomials w0, generating a first test vector r0 as w0-cs2, and checking whether said first test vector r0 fulfills a first condition,
    - when said first condition is met, generating a second test vector z= y + cs1, and checking whether said second test vector z fulfills a second condition, and wherein, when said second condition is met, said signature is generated from said second test vector.

    SECURE COMMUNICATION METHOD AND RELATED DEVICE

    公开(公告)号:EP4401357A1

    公开(公告)日:2024-07-17

    申请号:EP22885595.3

    申请日:2022-09-30

    IPC分类号: H04L9/30

    CPC分类号: H04L9/30

    摘要: Embodiments of this application provide a secure communication method. In the method, security check is introduced in a plaintext information transmission process. An access network device preconfigures a security check value or a correspondence between a security check value and plaintext information, and performs security check in subsequent communication, to reduce security risks caused by user data exposure.

    ENCRYPTED DATA COMPARISON USING BOOTSTRAPING EVALUTION INVOLVING  TORUS BASED FULLY HOMOMORPHIC SCHEMES

    公开(公告)号:EP4395226A1

    公开(公告)日:2024-07-03

    申请号:EP23168475.4

    申请日:2023-04-18

    申请人: Vaultree, Ltd.

    发明人: Pradhan, Anil

    IPC分类号: H04L9/00 G06F7/02 H04L9/30

    CPC分类号: H04L9/008 H04L9/3093 G06F7/02

    摘要: The present disclosure relates to a system and method for manipulating encrypted data. In particular, the present disclosure relates to improvements homomorphic encryption. Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. As such, computations can be performed on data that has been homomorphically encrypted without access to the secret key. The output from a computation performed on homomorphically encrypted data will be homomorphically encrypted data. This output can be left in an encrypted form.

    SECURE MULTIPARTY LOSS RESISTANT STORAGE AND TRANSFER OF CRYPTOGRAPHIC KEYS FOR BLOCKCHAIN BASED SYSTEMS IN CONJUNCTION WITH A WALLET MANAGEMENT SYSTEM

    公开(公告)号:EP4383643A2

    公开(公告)日:2024-06-12

    申请号:EP24172243.8

    申请日:2017-02-14

    IPC分类号: H04L9/30

    摘要: The invention provides a computer-implemented solution for controlling access to a computer-related resource such as, for example, a digital wallet. In one or more embodiments, the wallet may be implemented using a blockchain such as the Bitcoin blockchain but the invention is not limited in this regard. Use of the invention during the initial set-up of the wallet can enable subsequent operations such as wallet transactions to be handled in a secure manner over an insecure channel such as the internet. A method according to an embodiment of the invention can comprise the steps of splitting a verification element (such as a private key in an asymmetric cryptography pair) into a plurality of shares; determining a common secret at two or more nodes in a network; and using the common secret to transmit at least one share of the verification element between the two or more nodes. The shares can be split such that no share on its own is sufficient to arrive at the verification element. This means that no one party stores the entire private key, providing for enhanced security of the key. Two or more shares are required to restore the key. The shares are stored at separate locations one of which is an independent back-up or safe-storage location. If one of the other shares becomes unavailable, the share can be retrieved from back up to ensure that the key (and thus the controlled resource) is still accessible. To ensure safe transmission of the share(s), the common secret is generated at two different nodes independently of each other and then used to generate an encryption key. The encryption key can be used to encrypt at least one share of the verification element, or a message comprising it, to ensure that the share(s) are transmitted securely.