Abstract: The present invention relates to a method for a secure execution of a whitebox cryptographic algorithm applied to a message (m) and protected by countermeasures based on pseudo-random values, comprising the steps of: executing a pseudo-random function (PRP) generating pseudo-random output values and an encrypted main output value based on an encrypted input value (*Xi*) derived from said message, securing said cryptographic algorithm by applying to the cryptographic algorithm said countermeasures based on said generated pseudo-random output values retrieving, from said generated encrypted main output value, the input value or part of the input value, under an encrypted form (*Xi*), executing said secured cryptographic algorithm on said encrypted retrieved value.

Abstract: The present invention relates to a security management system for performing a secure transmission of data from a token to a service provider server by means of an identity provider server, wherein said security management system comprises: —said identity provider server which is adapted to: —open with said token a secure messaging channel by means of a General Authentication Procedure using at least one certificate; —receive via said secure messaging channel from said token enciphered data; —transmit to said service provider server said enciphered data; —said service provider server which is adapted to: —receive from said identity provider server enciphered data of said token; —decipher said enciphered data to extract said data; —said token which is adapted to: —encipher data; and—transmit via said secure messaging channel to said identity provider server said enciphered data.

Abstract: The present invention relates to a method for reaching a consensus for appending, at a current round (j), a new block of data to a permissioned ledger distributed through a network comprising network connected devices authorized by the ledger, called nodes, said method being performed by a tamper-proof computing device configured for managing securely digital keys and comprising a random number generator and a cryptoprocessor for generating signatures with said keys, and comprising, for a set of transactions to be validated, the steps of: receiving, from at least a first node (Nk), a candidate block (Bj,Nk) computed by said first node on transactions among said set of transactions, for each received candidate block, generating a random value by the random number generator, and generating a signed selection message comprising: an identifier of the current round (j), said received candidate block (Bj,Nk) and said generated random value by said cryptoprocessor, broadcasting said signed selection messages to th

Abstract: A system and method of operating a database system to protect personal identifiers from being revealed. The system and method obfuscates personal identifiers using a secret value, storing in a database records containing the obfuscated personal identifier, storing the secret value in a identifier translation device, receiving at a request preparer a record request identifying a requested record using a non-obfuscated personal identifier, and operating the request preparer to direct the identifier translation device to translate the non-obfuscated personal identifier into an obfuscated personal identifier using the secret value stored in the identifier translation device and using the obfuscated personal identifier in a query to the database.

Abstract: The present invention relates to a method of secure generation of an RSA signature of a message to be signed with a private exponent component d of an RSA key (p, q, N, d, e), where e is a public exponent component, N is a RSA modulus, p and q are primes such that N=p·q and e·d=1 modulo ?(N) with ?(.

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, . . .

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).

Abstract: The invention is a method for managing access to a service wherein the method comprises the following steps: a client application sends to an application server a request to access the service by using credentials and a first anti-clone code, the application server performs a verification of the credentials and said first anti-clone code, the application server sends a second anti-clone code to the client application and deactivates said first anti-clone code only in case of successful verification, said second anti-clone code being required for the next attempt to access the service.

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.

Abstract: The present invention relates to a security management system for performing a secure transmission of data from a token to a service provider server by means of an identity provider server, wherein said security management system comprises: —said identity provider server which is adapted to: —open with said token a secure messaging channel by means of a General Authentication Procedure using at least one certificate; —receive via said secure messaging channel from said token enciphered data; —transmit to said service provider server said enciphered data; —said service provider server which is adapted to: —receive from said identity provider server enciphered data of said token; —decipher said enciphered data to extract said data; —said token which is adapted to: —encipher data; and —transmit via said secure messaging channel to said identity provider server said enciphered data.

Abstract: The invention is a method for managing access to a service wherein the method comprises the following steps: a client application sends to an application server a request to access the service by using credentials and a first anti-clone code, the application server performs a verification of the credentials and said first anti-clone code, the application server sends a second anti-clone code to the client application and deactivates said first anti-clone code only in case of successful verification, said second anti-clone code being required for the next attempt to access the service.

Abstract: A system and method of operating a database system to protect personal identifiers from being revealed. The system and method obfuscates personal identifiers using a secret value, storing in a database records containing the obfuscated personal identifier, storing the secret value in a identifier translation device, receiving at a request preparer a record request identifying a requested record using a non-obfuscated personal identifier, and operating the request preparer to direct the identifier translation device to translate the non-obfuscated personal identifier into an obfuscated personal identifier using the secret value stored in the identifier translation device and using the obfuscated personal identifier in a query to the database.

Abstract: A secure method for transmitting a control word between a server and a plurality of processing entities so as to respectively produce and utilize the control word. Preferably such a method is applied to the field of conditional access methods and systems for preventing the fraudulent use of compromised decryption keys resulting from a coalition of pirate hackers.

Abstract: The present invention provides a method for establishing a secure communication channel between a client (C) and a remote server (S), said client (C) and remote server (S) exchanging data through an intermediate entity (G), said client (C) having a long-term key pair (skc,pkc), said remote server generating an ephemeral key (sks,pks), the method comprising a mutual authentication step wherein the client (C) sends a public key (pkc) of said long-term key pair (skc, pkc) and the proof that said public key (pkc) is valid to the server (S), and wherein the remote server (S) sends the public key (pks) of said ephemeral key pair (sks,pks) to the client (C). The client (C) generates an ephemeral key pair (skCc,pkCc) and sends the public key (pKcc) of said ephemeral key pair (skcc,pkcc) to the server (S) so as to generate a secret common to the client (C) and to the remote server (S) for opening the secure communication channel.

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: The present invention concerns the implementation of end-to-end security for the communication between a low cost card reader and the remote server. The purpose of the present invention is the establishment of a secure channel between the card reader and the remote server through an un-trusted communication device (e.g. a smart phone or a tablet) that is intrinsically resistant to some basic differential side-channel analysis in a context where there is no secure random number generator and no source of entropy in the card reader, while providing the following characteristics:—Mutual authentication between the card reader and the server—Secure channel based on session keys such that the keys of the secure channel related to a past transaction cannot be re-played, or the session keys of a future transaction cannot be pre-computed by the card reader and later re-use by the card reader in a legitimate transaction.

Abstract: The invention proposes an off-line divisible e-cash scheme where a user can withdraw a divisible coin of monetary value nL (n being for example equal to 2) that he can parceled and spend anonymously and unlinkably. The invention allows to protect the anonymity of honest users and to revoke anonymity only in case of cheat for protocols based on a tree structure without using a trusted third party.

Abstract: The invention relates to a method and a system for conditional access making it possible to prevent the fraudulent use of a subscriber electronic device (1a, 1b, 1m) and to thus effectively combat the fraudulent making available of protected contents. The invention further relates to the adaptation of such a device as well as to a method allowing the revocation of the latter if it is deemed to be illicitly exploited or its possible reinstatement.

Abstract: The invention relates to a method for preventing the fraudulent use of an electronic device and thus for effectively combating the fraudulent dissemination of protected content. The invention further relates to such a device as well as to a method enabling permanent revocation thereof if the device is considered to be unlawfully used or optional reinstatement of the device.

Abstract: The invention relates to a system (1) for issuing electonic money, transfering said money from an e-Money sender (30) to an e-Money receiver (40) and compensating said money, said system comprising an issuer (10) or e-Money Issuer for issuing said electonic money, characterized in that it comprises at least one regulated entity (60), so that the issuance of the electonic money is regulated, and the transfer and subsequent usage or misuse of the e-money is monitored.