Round-Optimal Secure Multiparty Computation with Honest Majority

  title={Round-Optimal Secure Multiparty Computation with Honest Majority},
  author={Prabhanjan Vijendra Ananth and Arka Rai Choudhuri and Aarushi Goel and Abhishek Jain},
  journal={IACR Cryptol. ePrint Arch.},
We study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimal n-party protocols, tolerating any \(t<\frac{n}{2}\) corruptions. 
Two Round Information-Theoretic MPC with Malicious Security
We provide the first constructions of two round information-theoretic (IT) secure multiparty computation (MPC) protocols in the plain model that tolerate any \(t<n/2\) malicious corruptions. Our
Perfect Secure Computation in Two Rounds
We show that any multi-party functionality can be evaluated using a two-round protocol with perfect correctness and perfect semi-honest security, provided that the majority of parties are honest.
The Broadcast Message Complexity of Secure Multiparty Computation
We study the broadcast message complexity of secure multiparty computation (MPC), namely, the total number of messages that are required for securely computing any functionality in the broadcast
Degree 2 is Complete for the Round-Complexity of Malicious MPC
It is shown that when considering the round complexity of MPC, it is sufficient to consider very simple functions.
Optimal Bounded-Collusion Secure Functional Encryption
We construct private-key and public-key functional encryption schemes in the bounded-key setting; that is, secure against adversaries that obtain an a-priori bounded number of functional keys (also
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority
This work study's the problem of secure multiparty computation for functionalities where only one party receives the output and shows that the exact round complexity of fully secure solitary MPC is 3, which is the same as fully secure standard MPC.
Multikey FHE in the Plain Model
We construct a multikey fully-homomorphic encryption scheme (multikey FHE) with one-round threshold decryption in the plain model, i.e. without a trusted setup, assuming the intractability of
On the Exact Round Complexity of Secure Three-Party Computation
We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a range of security notions such as selective abort, unanimous abort, fairness and guaranteed
Fast Actively Secure Five-Party Computation with Security Beyond Abort
Going beyond the most popular honest-majority setting of three parties with one corruption, the results demonstrate feasibility of attaining stronger security notions for more than one active corruption at an expense not too far from the least desired security of selective abort.
Multiparty Reusable Non-Interactive Secure Computation from LWE
A construction of mrNISC is given that achieves standard simulation security, as classical multi-round MPC protocols achieve, and achieves semi-malicious security in the plain model and malicious security by further relying on trusted setup (which is unavoidable for mmNISC).


Secure Computation with Minimal Interaction, Revisited
This work revisits the question of MPC with only two rounds of interaction and considers a minimal setting in which parties can communicate over secure point-to-point channels and where no broadcast channel or other form of setup is available.
Multiparty unconditionally secure protocols
It is shown that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest and the secrecy achieved is unconditional.
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
A constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator and which withstands an active, adaptive adversary corrupting a minority of the parties.
Two-Round Multiparty Secure Computation from Minimal Assumptions
These protocols are provided assuming the minimal assumption that two-round oblivious transfer (OT) exists and that the protocol is secure against semi-honest adversaries and malicious adversaries.
On 2-Round Secure Multiparty Computation
This work shows that 3 is the exact round complexity of general secure multiparty computation, assuming the availability of secure point-to-point channels and a broadcast primitive, and presents some positive results by identifying a useful class of functions which can be securely computed in two rounds.
The Exact Round Complexity of Secure Computation
The exact round complexity of secure computation in the multi-party and two-party settings is revisited and a variety of results offering trade-offs between rounds and the cryptographic assumptions used are obtained, depending upon the particular instantiations of underlying protocols.
Non-interactive zero-knowledge and its applications
It is shown that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string, and this result is used to construct the first public-key cryptosystem secure against chosen ciphertext attack.
Secure Multiparty Computation with Minimal Interaction
This work revisits the question of secure multiparty computation with two rounds of interaction and shows that under a relaxed notion of security, allowing the adversary to selectively decide which honest parties will receive their (correct) output, there is a general 2-round MPC protocol which tolerates t < n/3 corrupted parties.
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
In this paper we construct the first publicly verifiable non-interactive zero-knowledge proof for any NP statement under the general assumption that one way permutations exist. If the prover is
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits
New constructions of round-efficient, or even round-optimal, Multi-Party Computation (MPC) protocols from Oblivious Transfer (OT) protocols are presented, resolving the round complexity of semi-honest MPC assuming weak and necessary assumption.