METHOD TO COUNTER DCA ATTACKS OF ORDER 2 AND HIGHER ON TABLE-BASED IMPLEMENTATIONS

    公开(公告)号:US20190229886A1

    公开(公告)日:2019-07-25

    申请号:US16337197

    申请日:2017-09-22

    Applicant: GEMALTO SA

    Inventor: Aline GOUGET

    Abstract: The present invention relates to a method to counter DCA attacks of order 2 and higher order applied on an encoded table-based (TCabi,j) implementation of block-cipher of a cryptographic algorithm to be applied to a message (m), said method comprising the steps of: —translating a cryptographic algorithm block-cipher to be applied on a message (m) into a series of look-up tables (Tabi,j),—applying secret invertible encodings to get a series of look-up tables (TCi,j),—computing message-dependent masking values, comprising the computation of at least two shares of masking value (mmask1, mmask2) for the input of the table network based on at least two different message derivation functions (F1, F2),—re-randomizing the tables (TCi,j) using the computed message-dependent masking values (mmask1, mmask2),—computing rounds to be applied on the message (m) based on the randomized network of tables (TCi,j).

    SECURE ELECTRONIC DEVICE WITH MECHANISM TO PROVIDE UNLINKABLE ATTRIBUTE ASSERTION VERIFIABLE BY A SERVICE PROVIDER

    公开(公告)号:US20180367305A1

    公开(公告)日:2018-12-20

    申请号:US16060977

    申请日:2016-12-09

    Applicant: GEMALTO SA

    Abstract: A method for operating an attribute assertion device having a processor and memory to create an unlinkable digital signature-equivalent of an assertion message that is verifiable—by a service provider receiving the unlinkable digital signature-equivalent—as being generated from a digital signature of a known attribute provider having a public key PKAP. Operating the processor of the attribute assertion device to transform a digital signature of the attribute message into an unlinkable digital signature-equivalent using a one-way transformation of the signature, with the transformation process using a random value generated by the attribute assertion device and a challenge provided by the service provider.

    METHOD TO INDEPENDENTLY COMPLETE THE PERSONALIZATION OF A TOKEN
    5.
    发明申请
    METHOD TO INDEPENDENTLY COMPLETE THE PERSONALIZATION OF A TOKEN 审中-公开
    独立完成东方个人化的方法

    公开(公告)号:US20160330025A1

    公开(公告)日:2016-11-10

    申请号:US15108661

    申请日:2014-12-15

    Applicant: GEMALTO SA

    CPC classification number: H04L9/0897 H04L9/00 H04L9/0844

    Abstract: The present invention relates to a method to independently complete the personalization of a token based on a secure hardware having the ability to store at least a secret and produced by a production entity, this completion of the personalization being performed at a business entity level with a business secret, comprising a preliminary personalization step wherein personalization data is stored in the token by the production entity, said token being associated with a unique sensitive credential recoverable from said personalization data using an external information, said external information being shared by a batch of tokens.

    Abstract translation: 本发明涉及一种基于具有至少存储秘密并由生产实体产生的能力的安全硬件来独立地完成令牌的个性化的方法,该个性化的完成是在业务实体级执行的 商业秘密,其包括初步个性化步骤,其中个性化数据由生产实体存储在令牌中,所述令牌与使用外部信息可从所述个性化数据可恢复的唯一敏感凭证相关联,所述外部信息由一批令牌共享 。

    METHOD OF RSA SIGNATURE OR DECRYPTION PROTECTED USING A HOMOMORPHIC ENCRYPTION

    公开(公告)号:US20200076614A1

    公开(公告)日:2020-03-05

    申请号:US16467957

    申请日:2017-12-06

    Applicant: GEMALTO SA

    Abstract: The present invention relates to a method of generating a secure RSA key by a server comprising the steps of: •generating (S1) a private RSA key d and a RSA modulus integer N; •splitting (S2) the secret key integer d in j key shares dJ of length n, with j in [1, J], J being an integer, and such that d=d1+d2+ . . . +dJ mod phi(N), with each key share dj being equal to (dj(0) . . . dj(i) . . . dj(n/b−1)) with each key share component dj(i) in {0 . . . 2{circumflex over ( )}b−1} and i in [0, n/b−1], b being an integer inferior to n and phi the Euler's totient function; •encrypting (S3) with a fully homomorphic encryption (FHE) algorithm each key share component dj(i) of the private RSA key d by using a Fully Homomorphic Encryption secret key ps of a set Ss comprising the index couple (i,j), to generate an encrypted key share component edj(i) of said secure RSA key, said set Ss being a set of integer couples, among a predetermined integer number u of disjoint sets {S1, S2 Ss, Ss+1, . . . Su} generated such that: U{Ss}={(i,j) such that i in [0, n/b−1], j in [1, J]} and each said set among {S1, . . . Su} being associated with a Fully Homomorphic Encryption (FHE) secret key.

    SYSTEM AND METHOD FOR PROVIDING PRIVACY IN SMART METER DEPLOYMENT
    8.
    发明申请
    SYSTEM AND METHOD FOR PROVIDING PRIVACY IN SMART METER DEPLOYMENT 有权
    用于在智能仪表部署中提供隐私的系统和方法

    公开(公告)号:US20140223526A1

    公开(公告)日:2014-08-07

    申请号:US13760248

    申请日:2013-02-06

    Applicant: GEMALTO SA

    Abstract: Privacy-preserving smart metering for a smart grid. Issuing a privacy-enhanced credential to a consumer node having smart meter. Operating the consumer node to associate an id with the credential and to use the id to report usage. Other systems and methods are disclosed.

    Abstract translation: 用于智能电网的隐私保护智能测量。 向具有智能电表的消费者节点颁发隐私增强凭证。 操作消费者节点将ID与凭据相关联,并使用该ID来报告使用情况。 公开了其它系统和方法。

Patent Agency Ranking