A method for multiparty computation wherein a plurality of parties each compute a preset function without revealing inputs thereof to others, comprises: each of the parties performing a validation step to validate that computation of the function is carried out correctly, wherein the validation step includes: a first step that prepares a plurality of verified multiplication triples and feeds a multiplication triple to a second step when required; and the second step that consumes a randomly selected multiplication triple generated by the first step, wherein the first step performs shuffling of the generated multiplication triples, in at least one of shuffle in a sequence and shuffle of sequences.

Some embodiments are directed to a data retrieval device 210 for data-obliviously copying a subarray of a first array to a second array. The length of the second array is more than one and less than the length of the first array. The length of the subarray is at most the length of the second array. For each first element at a first index in the first array, the data retrieval device selects a second index in the second array for the first index in the first array; data-obliviously computes a choice bit indicative of whether to copy the first element to the second index in the second array; and replaces a second element at the second index in the second array by a replacement element, the replacement element being data-obliviously set to the first element or the second element based on the choice bit.

An apparatus for secure multiparty computations for machine-learning is presented. The apparatus includes at least a processor and a memory communicatively connected to the at least a processor. The memory contains instructions configuring the at least a processor to submit a secure multiparty computation request onto an immutable sequential listing, wherein the secure multiparty computation request includes a contingent payment and an authenticity commitment of a first private dataset, receive at least a participant commitment from each participating device of a quorum of participating devices, generate a first localized model as a function of the first private dataset, and perform a joint training protocol as a function of the first localized model and a second localized model from the quorum of participating devices, wherein the joint training protocol includes generating a joint training datum.

A secret sharing storage system includes at least one user terminal, n units (n: an integer of 2 or more) of storage devices, and a main controller that is communicably connected to a random number generator. The main controller acquires a random number generated by the random number generator in a case of receiving original data sent from the user terminal, executes distributed processing on the original data by using the random number to generate n pieces of distributed data, and stores the n pieces of distributed data respectively in the corresponding n units of storage devices.

A secure computation device obtains a first concealed verification value [z].sub.i=[w−ω].sub.i with secure computation by using concealed authentication information [w].sub.i which is preliminarily stored and concealed authentication information [ω].sub.i which is inputted, obtains a concealed extension field random number [r.sub.m].sub.i∈[F.sup.ε] which is a secret sharing value of an extension field random number r.sub.m, obtains a second concealed verification value [y.sub.m].sub.i in which y.sub.m is concealed with secure computation by using the first concealed verification value [z].sub.i, and obtains a third concealed verification value [r.sub.my.sub.m].sub.i with secure computation by using the concealed extension field random number [r.sub.m].sub.i and the second concealed verification value [y.sub.m].sub.i and outputs the third concealed verification value [r.sub.my.sub.m].sub.i.

An apparatus for set intersection operation according to an embodiment includes a ciphertext acquisition unit configured to acquire a ciphertext for a first vector corresponding to a first subset of a universal set including a plurality of elements from an encryption apparatus, a transform unit configured to generate a second vector corresponding to a second subset of the universal set, a computation unit configured to generate a ciphertext for a third vector corresponding to an intersection of the first subset and the second subset, based on the ciphertext for the first vector and the second vector, and a ciphertext providing unit configured to provides the ciphertext for the third vector to the encryption apparatus.

Systems and methods for implementing a secure and efficient cryptographic protocol for analyzing data objects while providing assurances of data privacy and security. A data object may be obfuscated and provided for analysis (e.g., to a data analytics service) without necessarily providing access to the (e.g., plaintext) data object. For example, a first computing entity and second computing entity may agree upon a function or circuit that performs a certain type of computational task, such as comparing a first data set controlled by the first computing entity and a second data set controlled by the second computing entity. An event-driven function may be invoked by the event-driven compute service in response to detecting satisfaction of a condition as part of monitoring alerts that are generated as a result of the output of the computational task described above.

An information processing apparatus that performs bit embedding processing by four-party MPC using 2-out-of-4 replicated secret sharing stores a seed to generate a random number used when performing an operation concerning shares, generates, by using the seed, share reconstruction data for reconstructing a share used when performing bit embedding, and constructs a share for bit embedding by using at least the share reconstruction data.

A method for secure multiparty computation of an inner product includes performing multiparty additions to generate a first sum share and a second sum share between two shares of alternating elements from corresponding pairs of elements in a first vector and a second vector, performing multiparty multiplications with at least one other node to generate inner product pair shares corresponding to products of the first sum shares and the second sum shares corresponding to pairs of elements in the first and second vectors, and performing another multiparty addition of each inner product pair share with a first negated shares of pair products corresponding to pairs of elements in the first vector and a second negated shares of pair products corresponding to pairs of elements in the second vector to generate a share of an inner product of the first and second vectors.

Methods and systems for managing cryptographic keys in on-premises and cloud computing environments and performing multi-party cryptography are disclosed. A cryptographic key can be retrieved from a hardware security module by a key management computer. The key management computer can generate key shares from the cryptographic key, and securely distribute the key shares to computer nodes or key share databases. The computer nodes can use the key shares in order to perform secure multi-party cryptography.