PRIVACY-PRESERVING EVALUATION OF DECISION TREES

    公开(公告)号:US20190190714A1

    公开(公告)日:2019-06-20

    申请号:US15849334

    申请日:2017-12-20

    Applicant: NXP B.V.

    Abstract: A method for performing a secure evaluation of a decision tree, including: receiving, by a processor of a server, an encrypted feature vector x=(x1, . . . , xn) from a client; choosing a random mask μ0; calculating m0 and sending m0 to the client, wherein m0=xi0(0)−t0(0)+μ0 and t0(0) is a threshold value in the first node in the first level of a decision tree ′; performing a comparison protocol on m0 and μ0, wherein the server produces a comparison bit b0 and the client produces a comparison bit b0′; choosing a random bit s0∈{0,1} and when s0=1 switching a left and right subtrees of ′; sending b0⊕s0 to the client; and for each level =1, 2, . . . , d−1 of the decision tree ′, where d is the number of levels in the decision tree ′, perform the following steps: receiving from the client y0 where k=0, 1, . . . , −1; performing a comparison protocol on and , wherein is a random mask and is based upon, x, , yk, and and the server produces a comparison bit and the client produces a comparison bit ; choosing a random bit ∈{0,1} and when =1 switching all left and right subtrees at level of ′; and sending ⊕ to the client.

    PROTECTING ECC AGAINST FAULT ATTACKS
    3.
    发明申请

    公开(公告)号:US20190132114A1

    公开(公告)日:2019-05-02

    申请号:US15795103

    申请日:2017-10-26

    Applicant: NXP B.V.

    Inventor: Marc JOYE

    CPC classification number: H04L9/004 H04L9/14 H04L9/302 H04L9/3066 H04L2209/26

    Abstract: A method for protecting against faults in a computation of a point multiplication Q=[k]P on an elliptic curve E defined over a prime field p, including: defining an integer r and a group ′={γ()|∈/r} represented with elements having a group law that coincides with a group law used in the representation for E(p) and isomorphic to an additive group (/r)+ through isomorphism γ; forming a combined group E(p)×′E(p)×(/r)+ which is isomorphic to a cross product of the groups E(p) and (/r)+; selecting an element in /r and defining an element P′=γ() in group ′; forming a combined element {circumflex over (P)}=CRT (P, P′) in the group E(p)×′; calculating {circumflex over (Q)}=[k]{circumflex over (P)} in the combined group E(p)×′; calculating k in /r; and checking whether {circumflex over (Q)}≡Q′ (mod r) where Q′=γ(k).

    ENCRYPTION SCHEMES WITH ADDITIONAL PROPERTIES

    公开(公告)号:US20190319791A1

    公开(公告)日:2019-10-17

    申请号:US15951590

    申请日:2018-04-12

    Applicant: NXP B.V.

    Abstract: Various embodiments relate to a method of encrypting a message m using a Paillier cryptosystem, including: computing a ciphertext c based upon the message m, N, and r, where N is the product of two distinct primes p and q, and r is randomly chosen such that r∈[1, N); computing a first verification value based upon u and N, where u is randomly chosen such that u∈[1, N); computing a second verification value s based upon u, r, the ciphertext c, the verification value, and a hash function H.

    PRIVACY PRESERVING COMPARISON
    6.
    发明申请

    公开(公告)号:US20190190694A1

    公开(公告)日:2019-06-20

    申请号:US15849420

    申请日:2017-12-20

    Applicant: NXP B.V.

    Abstract: A method for performing a secure comparison between a first secret data and a second secret data, including: receiving, by a processor of a first party, encrypted bits of the second secret data y from a second party, where is an integer; computing the Hamming weight h of first secret data x, wherein x has bits; computing the value of a first comparison bit δA such that δA=0 when h>└/2┘, δA=1 when h

Patent Agency Ranking