100results about "Communication with homomorphic encryption" patented technology

Method and system for processing encrypted data comprising evaluating a client's encrypted data vector by at least one decision tree provided by a server. This method comprises, for evaluating a client's encrypted data vector by at least one decision tree (22) provided by a server (6), in a comparison phase: by a first execution environment, implementing a homomorphic encryption scheme, calculation (52, 54) of an evaluation vector, comprising encrypted components representing a difference between a component of the encrypted data vector and a decision threshold value associated with a corresponding node of said at least one decision tree, and providing the evaluation vector to a second execution environment which is a secure execution environment, executed by said server but controlled by said client.and by the second secure execution environment: - decryption (56) of said evaluation vector by applying a private key of said client, determination (58) of the sign of each component of the decrypted evaluation vector and provision of an encrypted sign vector to the first execution environment. Figure for the abstract: Figure 4,

Certain aspects of the disclosure provide a method for verifiable key rotation of an encryption key. The method includes generating a ciphertext by encrypting a plaintext with a homomorphic probabilistic encryption scheme based on a first key. The method further includes generating an updating token based on a difference between the homomorphic probabilistic encryption scheme based on a second key and generating a second ciphertext by encrypting the first ciphertext with the updating token. The method further includes validating the key rotation by selecting a set of second ciphertext blocks from the second ciphertext; reverting the set of second ciphertext blocks with the updating token to a set of third ciphertext blocks; and computing a Hamming distance between blocks of the set of second ciphertext blocks and the corresponding set of third ciphertext blocks.

A storage controller, a client system, and a method of operating a storage controller are disclosed. The client system includes a client host device and a client storage device including a storage controller and a storage memory. The storage controller includes a host interface, a processor configured to control read and write operations to the storage memory, and a homomorphic encryption and decryption accelerator configured to: based on receiving a read request from the client host device, perform homomorphic encryption on first plaintext data read from the storage memory to generate first homomorphic ciphertext data, and provide the first homomorphic ciphertext data to the client host device through the host interface; and based on receiving a write request from the client host device, perform homomorphic decryption on second homomorphic ciphertext data received through the host interface to generate second plaintext data, and write the second plaintext data into the storage memory.

Provided is an NTT acceleration chip, including: a twiddle factor computing module, including a plurality of pre-computing units and a plurality of real-time computing units, where the plurality of pre-computing units is configured to compute several initial lines of twiddle factors and an inter-line step factor in parallel by using a primitive root of unity; and the plurality of real-time computing units is configured to repeatedly and iteratively compute other lines of twiddle factors in parallel according to the inter-line step factor; a transposition module, including a plurality of transposition units, configured to perform transposition processing on an input sequence in parallel, to obtain a transposed sequence; and an NTT computing module, including a plurality of butterfly computing units, configured to perform a butterfly operation of orders and a point quantity in parallel according to the twiddle factors and the transposed sequence, to obtain an output sequence.

A provider terminal apparatus encrypts a vector obtained by vectorizing a plurality of pieces of provided date with homomorphic encryption to generate indexes, generates a plurality of pieces of encrypted data obtained by encrypting the pieces of provided data, and transmits a search table in which the indexes and the encrypted data are included to an information search server (1). A searcher terminal apparatus transmits a search query obtained by encrypting a vector obtained by vectorizing query information with homomorphic encryption to the information search server (1). The information search server (1) performs homomorphic operation according to the homomorphic encryption between the search query and each of the indexes registered in the search table, creates a similarity list, and transmits the similarity list to the searcher terminal apparatus. The searcher terminal apparatus extracts a similar index similar to the search query based on the similarity list.

A method for processing a digital content with a decision tree, including: transmitting a ciphertext to a server; obtaining, from the server, a processed ciphertext function of an encryption of a difference between a third vector equal to a multiplication of the plaintext and a first matrix, and a first vector; decrypting the processed ciphertext; setting elements of the processed plaintext selectively to 1 or 0; encrypting the processed plaintext; transmitting the resulting second ciphertext to the server; obtaining, from the server, a second processed ciphertext function of an encryption of a difference between a fourth vector equal to a multiplication of the processed plaintext and a second matrix, and a second vector; decrypting the second processed ciphertext; setting elements of the resulting second plaintext selectively to 0 or 1; and determining an outcome of the decision tree based on the second plaintext.

The method includes receiving data and a plurality of values ​​at a processor. The data may include real-valued data and / or complex-valued data. The plurality of values ​​may include one of a plurality of random values ​​or a plurality of pseudo-random values. The method also includes generating, via the processor, an automorphism based on the plurality of values, and partitioning, via the processor, the data into a plurality of data blocks. The automorphism includes at least one of a linear transformation or an anti-linear transformation. Each data block from the plurality of data blocks may have a predefined size. The method also includes applying, via the processor, an automorphism to each data block from the plurality of data blocks to generate a plurality of transformed data blocks, and generating a transmission of a signal representative of the plurality of transformed data blocks.

A method and system for fully homomorphic-encryption (FHE) inference is presented. The method includes receiving, by a computing system, an encrypted request comprising a plurality of ciphertexts; loading, in response to the encrypted request, auxiliary data onto a first set of accelerators and a second set of accelerators; loading a first set of the plurality of ciphertexts onto the second set of accelerators; refreshing the first set of ciphertexts by executing, on the first set of accelerators, a bootstrapping operation that uses the auxiliary data; processing the first set of ciphertexts and a second set of the plurality of ciphertexts; and generating a response ciphertext based on the processing of the first and second sets of ciphertexts.

A computer implemented method can receive n training samples including sample values corresponding to m attributes and respective target values (n and m are positive integers), duplicate the sample values corresponding to the m attributes, pack the sample values into ciphertexts based on a batching option, and train a regression tree using the ciphertexts. The training is configured to encrypt the regression tree through homomorphic operations on the ciphertexts.

A system for securely determining a decrypted prediction result is disclosed. The system includes a plurality of computing devices, wherein each computing device encodes input feature variables from a vertically partitioned dataset with a public public key to generate a ciphertext feature subset, sends the ciphertext feature subset to a first server, receives a ciphertext prediction result, and transforms the ciphertext prediction result to obtain a target ciphertext prediction result. The first server includes a machine learning model that receives the ciphertext feature subsets from the computing devices, concatenates the ciphertext feature subsets to determine a complete ciphertext, evaluates the complete ciphertext to output a ciphertext prediction result, and sends the ciphertext prediction result to the computing devices. A second server receives the target ciphertext prediction results, aggregates the respective target ciphertext prediction results to obtain an aggregated target ciphertext prediction result, and decrypts the aggregated target ciphertext prediction result to obtain a decrypted prediction result.

Some embodiments are directed towards generating a public key and / or encrypting a message () with the public key. Generating a public key may involve computing a vector in the public key, which involves applying the equations (I), (I) of a bivariate vector-valued function to a random vector and a private key. Encrypting a message may involve computing a vector (a), which includes applying the bivariate vector-valued function to the vector in the public key and the random vector to compute a scalar (b). The resulting ciphertext may be of type LWE. Noise may be added for security.

A method includes obtaining a plurality of representative vectors associated with face-related data. The method includes determining an encryption key based on a parameter stored in a record, generating an encrypted vector set by, for each respective vector of the plurality of representative vectors, encrypting the respective vector with a homomorphic encryption operation based on the encryption key, where the encrypted vector set includes a first encrypted vector that is linked to a subset of the face-related data associated with the first plurality of face vectors. The method further includes obtaining an encrypted face search vector using the encryption key to perform homomorphic encryption. The method further includes selecting a first encrypted vector based on the encrypted face search vector and retrieving the subset of the face-related data based on the first encrypted vector.

The invention is a cryptographic pseudonym mapping method for an anonymous data sharing system, the method being adapted for generating pseudonymised data from entity data originating from data sources (DSj), wherein the data are identified at the data sources (DSj) by entity identifiers (D) of the respective entities, and wherein the pseudonym ised data are identified by pseudonyms assigned to the respective entity identifiers (D) applying a one-to-one mapping. Furthermore, the invention is a computer system implementing the method, and a computer program and a computer-readable medium.

A method is provided for a device participating in a data aggregation service. The device receives, from at least one requesting server, a participant homomorphic encryption key, and a request for data to perform a computation. The device encrypts requested data, including a location identifier, with the participant homomorphic encryption key, and sends, to an aggregation service, the encrypted requested data.

A method and apparatus for comparing a movement path based on homomorphic encryption are disclosed. One of the servers includes a processor configured to: collect encrypted first movement path information of a comparison target encrypted by a public key; receive, from a user device, encrypted second movement path information of a user of the user device encrypted by a private key; compare the encrypted first movement path information and the encrypted second movement path information; decrypt a part of a comparison result by the public key to generate a partially decrypted comparison result; and provide the partially decrypted comparison result to the user.

There is provided a method, apparatus and computer program for causing an apparatus to perform: obtaining at least one audio signal; compressing the at least one audio signal using at least one first algorithm to output at least one compressed audio signal, wherein a summation of two or more compressed audio signals is largely homomorphic to a summation of two or more audio signals; and encrypting the at least one compressed audio signal using a homomorphic encryption algorithm to form at least one encrypted audio signal.

The present disclosure relates to the technical field of federated learning, and provides a prediction method and device in federated learning. The method comprises: predicting, by using participant models of a plurality of participants, to-be-predicted data to obtain a first prediction result; updating model parameters of the participant models of the plurality of participants based on the first prediction result; re-predicting, by using the participant models of the plurality of participants after the model parameters are updated, to the to-be-predicted data to obtain a second prediction result; and calculating a third prediction result according to the second prediction results corresponding to the plurality of participants. By using the above technical means, the problems in the prior art that in federated learning, the prediction result is not related to the training of the model, and only federated learning models can be used for prediction are solved.

A device, system, and method for back-up and recovery of a private cryptocurrency key at a remote crypto vault. Once-encrypting an unencrypted private cryptocurrency key, at a client, with a non-homomorphic encryption key, transmitting the once-encrypted cryptocurrency key to the remote crypto vault to be double-encrypted with a homomorphic encryption key to generate a backup of the private cryptocurrency key stored at the remote crypto vault. Retrieving from n distinct remote crypto vault devices, n respective homomorphic private key shares sk 1 ,...,sk n , to generate n respective partial homomorphic decryptions p 1 ,...,p n of the double-encrypted backup of the private cryptocurrency key. Combining, at the remote crypto vault, up to n partial homomorphic decryptions p 1 ,...,p n to generate a full homomorphic decryption of the double-encrypted key to restore the once-encrypted key, transmitting the once-encrypted key to the client, which decrypts it to recover the unencrypted private cryptocurrency key.

An information processing device (200) for managing item-related information relating to an item handled by a plurality of traders constituting a supply chain (SC) comprises: a database (DBK) in which each of multiple sets of secret keys based on homomorphic encryption and public keys corresponding to the respective secret keys is associated with a key name and stored; an encrypted information acquisition unit (214) that acquires, from a trader terminal (100) of a trader, encrypted information obtained by encrypting the item-related information using a public key, and the key name of the public key used for encrypting the item-related information; a key acquisition unit (216) that acquires a secret key corresponding to the key name from the database; a decrypted information acquisition unit (218) that acquires decrypted information by decrypting the encrypted information using the secret key; an encryption processing unit (220) that encrypts the decrypted information to acquire re-encrypted information; and a provision unit (222) that provides the re-encrypted information obtained by encryption by the encryption processing unit to the trader terminal.

To provide a method and a system for efficient zero-knowledge verification of compound statements that simultaneously require both arithmetic circuit satisfiability and dependent statements about the validity of a public key.SOLUTION: In a method, a prover sends, to a verifier, a set of data including a statement that is about an elliptic curve point and the output of a given function circuit whose input is equal to the corresponding elliptic curve point multiplier. The data includes individual wire commitments and batched commitments for the circuit, inputs and outputs of the statement. The prover sends an opening in response to a challenge from the verifier. Using the data received from the prover, the verifier determines that the circuit is filled, computes the elliptic curve point to verify the statement, and determines that it holds evidence for the statement. Upon receiving the data, the verifier determines through computation that the data fits the statement.SELECTED DRAWING: None

The present invention relates to a privacy-preserving EV charging authorization and billing system, and a method for the same. The proposed system is configured to integrate permissioned blockchain with fully homomorphic encryption. The present invention aims to eliminate plaintext exposure mitigates single point of failure, by performing all authorization and billing computations on encrypted data and recoding transactions immutably, wherein an EV user securely generates encrypted authorization and billing requests using FHE-based public keys. The charging station routes these encrypted requests to the blockchain network, which records immutable encrypted transactions and verifies them via consensus. The FHE computation layer performs secure operations on the encrypted data for authorization and billing, while smart contracts execute automated verification and billing computations, ensuring transparency and auditability.

Method for enabling a client device (CD) to interact with an authentication server (AS) over a network, comprising steps performed by a singularization server (SS) of: - receiving (S3) an encrypted passphrase and a user identifier (UI) from a stateless proxy (SP); - determining (S4) a singularization value for said user identifier; - applying (55) a hash function to a combination of said encrypted passphrase and said singularization value, said encryption function being associated with an encryption scheme homomorphic with respect to said hash function, and transmitting (S6) the result and said user identifier (III) to said stateless proxy (SP).

The present disclosure provides techniques for processing a three-dimensional (3D) object file or object model in a privacy-preserving manner. An example method includes receiving, from a remote computing device, an encrypted object file comprising a specification of a 3D printable object and receiving a request to process the encrypted object file to identify a characteristic of the 3D printable object. The method also includes obtaining an encrypted comparison file and computing an encrypted Minkowski sum of the encrypted object file and the encrypted comparison file to generate an encrypted result file that comprises information about the characteristic. Computing the encrypted Minkowski sum is performed without decrypting the encrypted object file. The method also includes sending the encrypted result file to the remote computing device.

A method for using biometric data to authenticate a subject as an individual whose biometric data has been previously obtained. In this embodiment, the method utilizes a series of computer processes with asymmetrically loaded servers that are configured with one-time values for use in multi-party computing to perform the authentication.

The invention relates to a cryptographic system (010) for applying a permutation to a set of values. The permutation is applied in a privacy-preserving way as a cryptographic secure multi-party computation between multiple cryptographic devices. A first device obtains first secret-shares of the set of values; encrypt the first secret-shares of the set of values; and send the encrypted first secret-shares to a second cryptographic device. The second cryptographic device receives the encrypted first secret-shares, and obtains second secret-shares of the set of values; applies a permutation to the encrypted first secret shares and to the second secret-shares; and provides the permuted encrypted first secret-shares to a third cryptographic device. The third cryptographic device receives the permuted encrypted first secret-shares, and decrypts the encrypted first secret-shares.

The disclosure is directed toward a method and system to efficiently determine an attention function by reducing bootstrapping steps and ciphertext matrix operations. A combined key and query matrix in plaintext is pre-calculated. A ciphertext-plaintext matrix multiplication of the combined key and query matrix with a ciphertext input is performed. The output of the resulting ciphertext-plaintext matrix multiplication of the combined key and query matrix is bootstrapped. A ciphertext-plaintext matrix multiplication of the value matrix with the ciphertext input is performed. The resulting ciphertext-plaintext matrix multiplication of the value matrix is bootstrapped.

The present disclosure provides a method, device and system for managing carbon data and a related apparatus. The method comprises: generating component carbon footprint data of a component, the component carbon footprint data comprising material carbon footprint data of a material for manufacturing the component and addon component carbon footprint data generated in the production and processing of the component; storing the encryption result of the addon component carbon footprint data in a first blockchain to trigger the first blockchain to generate and store first encrypted component carbon footprint data of the component based on homomorphic encryption operation; acquiring a first verifiable credential for the average component carbon footprint data of a batch of components containing the component, wherein a first public key for verifying the first verifiable credential is stored in a second blockchain; and sending, in response to a component carbon footprint request from a product manufacturer, the component carbon footprint data and the first verifiable presentation generated based on the first verifiable credential to the product manufacturer. Thus, this scheme can ensure the reliability, security and transparency of carbon footprint data while protecting the identity privacy of suppliers.

A (secure) matching system includes a user-side apparatus; and a service-side apparatus. The user-side apparatus includes a user key generation part and a registration part that registers a registration ciphertext in the service-side apparatus. The service-side apparatus includes a service key generation part, a conversion key generation part that generates a conversion key for converting a first ciphertext encrypted with a service public key into a second ciphertext encrypted with a user public key without executing a decryption process, and a matching part. The service-side apparatus generates a second ciphertext with the conversion key after generating a first ciphertext obtained by encrypting features used as a matching source with the service public key and matches the second ciphertext against a registered ciphertext.

An electronic apparatus processing homomorphic encryption includes at least one processor including processing circuitry and memory, and the at least one processor is configured to obtain a first ciphertext by performing homomorphic encryption on plaintext data with a first secret key, obtain, through a first key switching module, a second ciphertext corresponding to a second secret key based on the first ciphertext, transmit the second ciphertext to the second key switching module, obtain, through a second key switching module, a third ciphertext corresponding to a third secret key based on the second ciphertext, transmit the third ciphertext to a decryption module, and obtain, through the decryption module, the plaintext data by decrypting the third ciphertext based on the third secret key.