Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
We want this process to protect the secrecy of y against a corrupted R and, at the same time, prevent a corrupted S from having an unfair influence on the ...
We consider the problem of secure two-party computation in a model that allows only parallel calls to an ideal oblivious transfer (OT) oracle with no ...
NISC achieves security against malicious senders and receivers, and also allows the receiver's message to be reusable across multiple computations (w.r.t. a ...
Oct 7, 2019 · We obtain the first concretely efficient 2-round protocols for generating useful correlations, including OT correlations, in the semi-honest security model.
Secure multi-party computation (MPC) enables multiple players to cooperatively evaluate various functions in the presence of adversaries.
People also ask
What is the SMPC algorithm?
Secure Multiparty Computation (SMPC) refers to a family of protocols in cryptography that enable a group of distrustful parties to jointly perform computations on their private inputs while ensuring the privacy of the inputs and the correctness of the protocol.
What are secure computation techniques?
Secure computation is a technology that enables computation while keeping data encrypted. In the modern data analysis process, the data is transferred to, stored in, and computed by the server. During these three processes, a typical encryption protects the data only when it is transferred and stored.
What is MPC computing?
Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography with the goal of creating methods for parties to jointly compute a function over their inputs while keeping those inputs private.
What are the limitations of multi party computation?
Limitations to Multiparty Computation Because multiparty computation needs parties to communicate with each other, one limitation to its protocols is the willing collusion between two parties to determine the data of a third party. This is possible if two parties are willing to share their own data with each other.
Oct 11, 2021 · Abstract. We consider the problem of securely generating useful instances of two-party corre- lations, such as many independent copies of a ...
Oct 28, 2016 · An important issue of secure multi-party computation (MPC) is to improve the efficiency of communication. Non-interactive MPC (NIMPC) ...
Nov 6, 2019 · We obtain the first concretely efficient 2-round protocols for generating useful correlations, including OT correlations, in the semi-honest security model.
We emphasize that our construction requires only LWE with polynomial modulus. This is important both for efficiency as well as for security. First, having a ...