Abstract: A method for computing the distance between two encrypted data vectors using elliptic curve cryptography.

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

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<?/2?, and ?A is randomly selected when h=/2; forming a set of ?/2? indexes that includes at least the indexes i where xi=?A; selecting random invertible scalars ri for each i in and computing c*i=+(1+(1?2?A)xi·yi2?A?1·(xj?yj))ri wherein w denotes the homomorphic encryption of w using a cryptographic key of the second party; selecting random invertible scalars r?1 and computing c*?1=(?A·xj?yj)r?1; transmitting ciphertexts c*i in a random order to the second party.

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

Abstract: An asset, which is a graphical 3D object, is protected at a processor of an encryption device that obtains the asset and a proxy including polyhedrons, processes points of the asset to obtain transformed points lying within the polyhedrons of the proxy, and outputs a protected asset including the transformed points. A decryption device including a processor decrypts the protected asset by obtaining the transformed points of the protected asset, processing transformed points using a reverse of the transformation to obtain reconstructed points of the asset, and obtaining a reconstructed asset using the reconstructed points.

Abstract: The present disclosure provides a method (1100) and apparatus (702) for inhibiting the interruption of the content being consumed by a user that is provided by an entertainment system. The method (1100) and apparatus (702) of the present disclosure may detect an interruption event and determine, based on the current state of a user, whether the interruption event matches the current state of the user. If the method (1100) and apparatus (702) of the present disclosure determine that the interruption event does not match the current state of the user, the method (1100) and apparatus (702) of the present disclosure may inhibit the interruption of the content being consumed by the user.

Abstract: A method for computing the distance between two encrypted data vectors using elliptic curve cryptography.

Abstract: Interactions with a multimedia content provider are tracked and communication is made with a physical activity tracking device to obtain movement information. The interactions and physical activity level provide insight as to a length of time a user has been continuously watching multimedia content. When a level of inactivity exceeds a threshold, access to multimedia content is adjusted, for example, by limiting access to the multimedia content and/or displaying a notification to the user regarding their level of inactivity.

Abstract: A method for producing a white-box implementation of a cryptographic function using garbled circuits, including: producing, by a first party, a logic circuit implementing the cryptographic function using a plurality of logic gates and a plurality of wires; garbling the produced logic circuit, by the first party, including garbling the plurality of logic gates and assigning two garbled values for each of the plurality of wires; and providing a second party the garbled logic circuit and a first garbled circuit input value.

Abstract: The present disclosure is directed to a method (100, 500) and apparatus (404A, 1000) for embedding data in a 3D model. The present disclosure provides for receiving a first 3D model comprising a plurality of polygons, selecting at least one polygon of the plurality of polygons, inserting at least one new point associated to data inside the selected at least one polygon and providing the second 3D model. The present disclosure is also directed to a method (700) and apparatus (404B, 1000) for decoding data embedded in a 3D model by receiving a 3D model including a plurality of polygons, detecting at least one added point inserted in a polygon of the plurality of polygons, decoding data associated to the detected at least one added point based on the location of the detected at least one added point inserted in the polygon, and providing the decoded data.

Abstract: The present principles generally relate to detection and analysis of sound events in a user's environment to automate changes to a multi-media player's state or action. The multimedia player characterizes ambient sound that it receives. The state or the action of the multimedia player is adaptively initiated or changed according to the characterization of the ambient sound and the location of the player, thus allowing adaptive adjustment of the sound of the audio/video content.

Abstract: A user inputs a password at a user device whose processor receives the password, retrieves a stored derived value resulting from a derivation function, preferably a cryptographic one-way function, applied to a reference password, scrambles the received password using a function taking the derived value as a variable to obtain a scrambled password, and sends the scrambled password to an authentication server. In case the stored derived value cannot be retrieved, the processor uses the derivation function to generate a derived value from the received password. In case the password is received during generation of a new password, the processor generates and stores a derived value from the new password. In an embodiment, the apparatus comprises the authentication server.

Abstract: In one embodiment, it is proposed a signing method delivering a partial signature associated with a message, said partial signature being used in a threshold signing method, the signing method being executed on an electronic device. Such signing method is remarkable in that it comprises signing a hash of said message with a one-time linearly homomorphic structure preserving signature method with a partial secret key, said partial secret key being obtained from an output of a secret sharing scheme, and said signing delivering said partial signature associated with said message.

Abstract: A threshold encryption system comprising a sender device configured to generate ciphertexts and at least one entity device configured to perform partial decryption of ciphertexts. The system is based on Cramer-Shoup encryption systems and use linearly homomorphic signatures as publicly verifiable proofs of ciphertext validity.

Abstract: The present principles use the message to be signed as a label—of the private key augmented with a QA-NIZK proof that the encrypted value is a persistent hidden secret. One-time homomorphic signatures are used to generate the signature and the public key. The private key for the one-time homomorphic signatures is included in the private key for signing the message, and the public key for the one-time homomorphic signatures is included in the public key for verifying the signature. Consequently, we obtain DLIN-based signatures comprised of only 6 group elements. The security proof uses a sequence of hybrid games, gradually moves to a game where all signatures contain an encryption of a random value while the QA-NIZK proofs are simulated proofs for false statements.

Abstract: In one embodiment, it is proposed a method of cryptographic processing of data, the method being executed by an electronic device, and comprising obtaining at least two points belonging to a same elliptic curve defined on an algebraic structure being a finite ring, each point being represented by at least two coordinates.

Abstract: A method and a device for generation of a cryptographic key pair for use in a (generalized) Goldwasser-Micali cryptosystem. The device generates a first prime p?1 (mod 2k), where k?1 is an integer, and a second prime q?3 (mod 4) or q?1 (mod 4); computes a modulus N=pq; picks an integer y?N\N, where N is a set of integers whose Jacobi symbol is 1 and N is a set of quadratic residues; and outputs a public key pk={N,y,k} and a private key sk={p,k}.

Abstract: A method for recommending content from among a collection of available content includes determining for each of available content at least one of a first, second and third content ratings related to (1) content characteristics that interfere with sleep patterns; (2) excitement level of the content; and (3) dynamic range of content audio, respectively. Thereafter, the content having a content rating that least interfere with sleep patterns is established. The available content having the content rating that least interferes with sleep patterns is recommended.

Abstract: In one embodiment, it is proposed a for ciphering digital data M being an element of a group T, said group T being part of a bilinear group of prime order p.

Abstract: A cryptographic device performs modular addition between a first integer value x and a second integer value y in a processor by: obtaining a first masked input {circumflex over (x)}, a second masked input ?, a first mask rx and a second mask ry, the first masked input {circumflex over (x)} resulting from the first integer value x masked by the first mask rx and the second masked input ? resulting from the second integer value y masked by the second mask ry; computing a first iteration masked carry value ?1, using the first masked input {circumflex over (x)}, the second masked input ?, the first mask rx, the second mask ry and a carry mask value ?; recursively updating the masked carry value ?i to obtain a final masked carry value ?k?1, wherein the masked carry value is updated using the first masked input {circumflex over (x)}, the second masked input ?, the first mask rx, the second mask ry, and the carry mask value ?; combining the first masked input {circumflex over (x)} and the second masked input ? and t