27 results about "Oblivious transfer" patented technology

The embodiment of the invention provides a batch retrieval method based on a verifiable bloom filter and electronic equipment, and relates to the technical field of data security. The method comprises the following steps: converting a server data set into a key value pair form, and mapping keywords in the data set in the key value pair form into equal repeated codes through an equal repeated code mapping algorithm to obtain an equal repeated code data set; determining a storage position of a second verifiable bloom filter according to a keyword in the equal-repetition-code data set, and storing a data entry corresponding to the keyword in the equal-repetition-code data set and a check code generated based on the data entry to the storage position; the client receives the query keyword set and maps the query keyword set to the first verifiable Bloom filter; and taking each bit of the first verifiable Bloom filter as a selection vector to execute an oblivious transmission protocol to obtain a return result of the server side. The embodiment provided by the invention provides a safe and efficient batch retrieval method based on the verifiable Bloom filter.

The present invention discloses a decision tree product recommendation method based on two-party secure computing, which can be applied to data holders or model holders. The method includes: obtaining a secret sharing of the decision tree root node index and a lookup table; obtaining a secret sharing of the node information of the corresponding node on the decision tree through a selection protocol, thereby obtaining a secret sharing of the corresponding eigenvalue index, and obtaining a secret sharing of the corresponding eigenvalue through a lookup table; comparing the eigenvalue and the threshold through a conditional oblivious transfer protocol, thereby selecting a left subtree node index or a right subtree node index; based on the secret sharing of the selected node index, obtaining a secret sharing of the node information of the corresponding node on the decision tree through a selection protocol, thereby obtaining a secret sharing of the corresponding classification value, updating the secret sharing of the product recommendation result based on the secret sharing of the classification value, traversing the decision tree until a predetermined number of nodes are traversed to obtain the final product recommendation result.

The disclosure provides a data matching method, and the method includes inputting to-be-matched first data into a pre-trained vector transformation model, to obtain a first vector corresponding to the first data and a binary vector corresponding to the first vector; obtaining a first intermediate vector using an oblivious transfer protocol, and obtaining a first distance intermediate result based on the first intermediate vector and a first predefined algorithm; receiving a second distance intermediate result generated, based on a second vector, a first random vector, and a second predefined algorithm, and sent by a second device; determining a target distance between the first vector and the second vector based on the first vector, the first distance intermediate result, and the second distance intermediate result; and determining whether the first data and second data match based on the target distance and a predefined first distance threshold.

Conducting secure transfers between computing devices can pose a challenge. Therefore, an oblivious transfer can be used to conduct a secure transfer. The oblivious transfer (OT) is an interactive protocol between two parties: a sender computing device and a receiver computing device. An OT protocol involves the sender computing device holding two messages m0 and m1, and the receiver computing device holding a bit b? {0, 1}. At the end of the protocol, the receiver computing device should only learn the message mb and nothing about the other message m1?b, while the sender computing device should learn nothing about the bit b. With the steady progress in quantum computing, several post-quantum oblivious transfer protocols can be derived.

The embodiments of this specification provide an oblivious transfer method and apparatus. Executed by a first party, wherein the first party maintains a global queue for storing obliviously transferred OT tuples, and multiple local queues maintained by taking OT tuples from the global queue; the method includes: for a first computing task, the first process of the first party obtains the first queue index of the first local queue allocated to the first computing task in the multiple local queues; when the first local queue is not empty, sequentially taking out OT tuples from the first local queue, and sending the first queue index to the second party, so that the second party sequentially takes out OT tuples from the local queue corresponding to the first queue index maintained locally, and performs oblivious transfer-based calculations with the second party using the OT tuples taken out by each party. It can meet the requirements of parallel processing, thereby improving operating efficiency.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating differential privacy noise. One example method includes generating, by a first party of two or more parties participating in a secure multiparty computation (MPC) instance, a first l-bit random number, where l is a positive integer; comparing a XOR result of the first l-bit random number and a second l-bit random number with an integer determined based on a target probability of a Bernoulli distribution, where the comparing comprises performing a comparison protocol based on oblivious transfer; and determining a Bernoulli sampling of a random number based on a result of the comparing. The Bernoulli sampling of the random number can be used to generate a random noise value, which can be added to an MPC computation result according to a differential privacy mechanism.

The present invention is a privacy-preserving non-invasive load monitoring method for smart grids, which decomposes smart meter readings from the household level to the appliance level. This method enables a user and server to jointly perform a non-invasive load monitoring task based on a deep neural network under privacy-preserving conditions. The server utilizes a pre-trained model to provide prediction services, and the user maintains their own household-level smart meter readings. The present invention utilizes lattice-based homomorphic encryption, secret sharing, and an oblivious transfer protocol to apply privacy-preserving techniques to the deep neural network (PSPNet). This enables the privacy-preserving PSPNet deep neural network to be used for NILM tasks, addressing the security requirements of both users and servers in NILM tasks.

The application discloses a privacy protection set intersection method, system and device. The method comprises the following steps: sending first matrix data to a computing node of a data receiver and sending array data to a computing node of a data sender, wherein the first matrix data is generated based on a preset rule, and the array data is generated based on set elements of the data sender; the computing node of the data receiver and the computing node of the data sender generate second matrix data based on batch oblivious transfer; an index array is generated when a hash function value of the first matrix is equal to a hash function value of the second matrix, wherein the index array is determined based on an index value when the hash function value of the first matrix is equal to the hash function value of the second matrix; and the data sender data node and the data receiver data node obtain intersection elements based on the index array. Through the method, data security can be protected during set intersection.

This document describes systems and techniques for using cryptography, secret sharing, secure MPC, garbled circuits, and oblivious transfer to select digital components in ways that preserve user privacy and protects the security of data of each party that is involved in the selection process. A method includes obtaining, by a first computer of a secure multi-party computation (MPC) system, at least a first share of user data related to a user of a client device. For each digital component in a set, a first secret share of a condition bit for the condition is obtained for each of one or more conditions that condition eligibility of the digital component for distribution. A garbled circuit is executed to select a given digital component for which each of the one or more conditions of the digital component is satisfied using the first secret share and the second secret share for each condition.

Methods for performing oblivious transfer are disclosed. These methods include a method for performing random single bit oblivious transfer (a “first method”), a method for performing random string oblivious transfer (a “second method”), and a method for performing non-random string oblivious transfer (a “third method”). In the first method, a sender computer can use a hardcore predicate function to obfuscate either a first message or a second message, generating an obfuscated message. The receiver computer can de-obfuscate this obfuscated message to randomly receive either the first message or the second message. The second method and third method can be implemented, with some modification, by repeatedly performing the first method, once for each “message bit” of the sender's messages. In the second and third methods, the receiver computer can send “indicator bits” to the sender computer, enabling the sender computer to transmit a random or non-random message strings to the receiver.

The present disclosure provides a method for laconic encryption, comprising: generating a public key and a secret key; computing a digest based on the public key; generating a ciphertext by combining the digest with a message; and decrypting the ciphertext using the secret key and non-secret decryption material. The method enables cryptographic primitives with sublinear communication complexity in two messages, where communication and computation complexity are essentially independent of the size of an input. The laconic encryption scheme is secure under the Learning With Errors assumption with polynomial modulus-to-noise ratio. The method can be used to construct laconic oblivious transfer, registration-based encryption, and laconic private-set intersection protocols with optimal parameters and practical efficiency. Additionally, the laconic encryption can be preprocessed for more efficient online encryption.

Systems and methods for conducting composable quantum oblivious transfer over noisy quantum channels are disclosed. Embodiments provide a method for constructing a quantum oblivious transfer (QOT) protocol using noisy quantum channels and devices through the use of a quantum-hard one-way function. This construction allows the construction of QOT protocols that achieve simulator security, allowing them to be used in a black-box fashion as part of other cryptographic constructions, including arbitrary secure multiparty computations.

Embodiments can perform efficient OT (oblivious transfer) protocols to efficiently establish OT correlations that could be used for an MPC protocol. The present embodiments relate to a non-interactive OT (NIOT) protocol using a key encapsulation mechanism (KEM). Two OT protocols are non-interactive OTs, in which a sender generates private, public key pair (pk, sk) that is independent of its input or generated OT correlations. The two OT protocols use a cryptographic hash function and a one-way secure dense key encapsulation mechanism (KEM).

Disclosed are various embodiments for a mutual privacy-preserving transfer of information using natural language and oblivious transfer (OT) protocols. A receiver entity can send a response request with prompts and corresponding keys to a sender entity. The sender entity can generate the responses using an output of large language models. Before sending the responses to the receiver entity, the sender entity encrypts the responses. The receiver entity can only decrypt the response that is encrypted using the public key associated with the receiver entity.

The invention discloses a lattice threshold encryption Internet of Things data privacy protection method based on a zero-trust architecture. The method comprises the following steps: step 1, identity registration; step 2, performing threshold encryption based on a lattice; step 3, grid-based threshold key sharing is carried out; and step 4, a lattice-based sub-key volume transmission protocol. Based on zero trust and cryptography algorithms, the privacy of Internet of Things data in the circulation process is enhanced, and secure transmission of keys and sub-keys is realized by using threshold secret sharing and a crowd transmission protocol. An error-based lattice cryptographic algorithm is adopted to process the data of the Internet of Things, and privacy leakage of the data of the Internet of Things is prevented. And meanwhile, verification of equipment and a user in an Internet of Things system is realized by utilizing a zero-trust architecture, so that the security during data sharing is improved.

The application discloses an authentic high-efficiency n-taken-k careless transmission method and system, and the method comprises the following steps: S1, a system establishment step, wherein a trusted authority KGC outputs system public parameters mpk and a secret master private key msk based on input security parameters; S2, a key generation step, wherein the trusted authority KGC outputs a public-private key pair corresponding to the identity of the sender and the receiver to the sender and the receiver based on the identity information of the accepted sender and receiver; S3, a careless transmission step, wherein the receiver encrypts k own keys and sends them to the sender; the sender converts the k keys and encrypts n information to generate n ciphertexts, and then sends the k converted keys and the n ciphertexts to the receiver; and S4, a decryption step, wherein the receiver uses the k converted keys to decrypt the n ciphertexts to obtain k desired information. The identity authentication problem of the sender and the receiver in the careless transmission process is solved, and efficient encryption and decryption are realized.

Disclosed herein are system, method, and computer program product embodiments for evaluating a decision tree in a privacy preserving manner. In embodiments, s first server receives a first partial share of the decision tree and encrypted input data from a client, wherein the input data comprises a set of attributes. A second server receives a second partial share of the decision tree. Each of the first server and the second server communicate with the other server to compute a classification result over the encrypted input data using the respective partial share of the decision tree received thereby and secure multi-party computation methods, including additive homomorphic encryption and oblivious transfer, such that the classification result is computed without decrypting the encrypted input data, and such that the classification result is ultimately received by the first server. The first server then transmits the classification result to the client.

The present application relates to a kind of information anonymous tracking query method and system based on blockchain and inadvertent transmission extension, realize the data privacy transmission between query node and data node by inadvertent transmission extension, the privacy information retrieval system based on consortium blockchain, the keyword or customer ID information of the object to be queried of inquiring party hides the object to be queried, data service party provides matching query result but cannot know which specific query object corresponds to;Data does not go out and can calculate, eliminate the possibility of data caching, data leakage, data trafficking;The transmission mode on chain makes the calculation process of privacy information retrieval safe, traceable, supervisable, reaches the effect of security self-evidence;Compared with traditional privacy information retrieval based on OT, performance is higher.

The application provides a two-factor authentication and key agreement method suitable for low-entropy biometrics, in the registration stage, a user sends a password and a biometric feature to a server; the server selects two secret values, uses a secret sharing algorithm to divide the secret values into multiple sub-secrets respectively, generates a sub-secret derived element based on the user password and the sub-secret, and stores the sub-secret derived element in an authentication file together with a random element. In the authentication and key agreement stage, the user sends the password to the server after blinding, the server processes the blinded password and returns it to the user, so that the user generates a password-related element without revealing the password information; the user uses a newly collected biometric feature to execute an oblivious transfer protocol with the server, obtains a randomized sub-secret derived element without revealing the biometric feature information, and constructs a secret derived element; the user calculates a randomized secret element based on the secret derived element and the password-related element, and derives a session key shared with the server from the secret element.

Embodiments of the present disclosure are directed to applying responsible gaming in a gaming environment while maintaining privacy for player information. Embodiments of the present disclosure utilize Oblivious Transfer (OT) and Private Set Intersection (PSI) protocols to address privacy concerns of responsible gaming systems. More specifically, embodiments address privacy concerns related to player global limits and banned player list queries and responses utilizing OT and PSI protocols. Embodiments not only addresses privacy concerns between the query user and the centralized database server but also mitigates privacy concerns between the query user and Certificate Authority (CA) by incorporating blind RSA signature scheme.

The application discloses a privacy protection gene sequence alignment method and system based on a oblivious transfer protocol, and comprises the following steps: setting a shared public random string; adopting one-hot encoding to encode a first gene sequence and a second gene sequence; selecting a first random string and a second random string in valid bits in the first gene sequence base encoding to form a first random ordered pair, wherein the first random string of the valid bits satisfies the public random string, and selecting a second random ordered pair in non-valid bits, so as to obtain a base encoding ordered pair; performing an oblivious transfer protocol according to each bit in the second gene sequence base encoding and the base encoding ordered pair to obtain a matching result of each bit; and judging whether the first gene sequence and the second gene sequence are equal according to the matching result. The method can protect gene sequence information and realize efficient and safe alignment of the gene sequence.

Example computer-implemented methods and systems for secure random noise generation are disclosed. One example method includes generating, by a first party, n random first bits and n -bit first strings. The first party generates, based on the n -bit first strings and the n random first bits, n pairs of -bit input messages. The first party receives n pairs of -bit second strings. The first party performs n 1-out-of-2 random oblivious transfers (ROTs) of the n pairs of -bit input messages from the first party to a second party. The first party generates, based on the n -bit first strings, a first random number. The first party performs, based on the first random number, secure multiparty computation (MPC) that involves the first party and the second party.

This document describes systems and techniques for using cryptography, secure MPC, garbled circuits, and oblivious transfer to select digital components in ways that preserve user privacy and protects the data of each party involved in the selection process. In one aspect, a method includes receiving, from a content platform by a first computer of a secure MPC system, a first garbled circuit for determining whether each of a first set of digital components satisfies a publication condition for display with a resource. The first computer evaluates the garbled circuit to obtain, for each digital component in the first set of digital components, a first secret share of a publication condition parameter that indicates whether the digital component satisfies the publication condition. The first computer generates a second garbled circuit for determining whether each digital component in a second set of digital components is eligible for display with the resource.

Systems and methods for conducting composable quantum oblivious transfer over noisy quantum channels are disclosed. Embodiments provide a method for constructing a quantum oblivious transfer (QOT) protocol using noisy quantum channels and devices through the use of a quantum-hard one-way function. This construction allows the construction of QOT protocols that achieve simulator security, allowing them to be used in a black-box fashion as part of other cryptographic constructions, including arbitrary secure multiparty computations.

A multi-party system comprising a garbler and an evaluator for interactively executing homomorphic SIMD operations using garbled circuits. The garbler and evaluator may each store a unique share of a shared secret key, a ciphertext, and a shared public key. The garbler and evaluator may each partially decrypt the ciphertext using its key share to generate a unique data share. The garbler may linearize and reduce the size of the unique garbler data share. The garbler may send to the evaluator a garbled circuit, a garbling of the linear unique garbled data share, and garbled potential wires for the evaluator to garble its linear unique evaluator data share by oblivious transfer. The evaluator may evaluate the garbled circuit to execute a SIMD program to combine, in parallel, multiple indices of the linear garbler and evaluator unique data shares to efficiently generate an encrypted result of the garbled circuit.

The present disclosure provides an end-to-end efficient privacy-preserving computation apparatus and method for secure two-party matrix inversion, relating to the technical field of privacy-preserving computation. In the present disclosure, the respective corresponding output matrices are determined using the privacy-preserving computation request and the private data matrices and then sent to the requesting party of the secure two-party inversion computation, so that the requesting party obtains the final inversion computation result. This solves the problems of large computation and communication overhead in ciphertext space caused by the introduction of homomorphic encryption and oblivious transfer techniques in the prior art, as well as the privacy and security issues caused by the leakage of original data and the loss of precision in floating-point number calculation due to the limitation of fixed-length digits in ciphertext computation.