Round-Optimal Secure Multiparty Computation with Honest Majority

Ananth, Prabhanjan; Choudhuri, Arka Rai; Goel, Aarushi; Jain, Abhishek

doi:10.1007/978-3-319-96881-0_14

Cited by 38 publications

(12 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Garg et al [91] show it is possible to build tworound MPC protocols that require a fixed number of OT calls, complemented by a polynomial number of cheaper oneway function calls, thus limiting the number of expensive public key operations. Ananth et al [92] build a two-round MPC protocol in the honest majority setting that can provide security with abort (an adversary may not prevent honest parties from learning the output of a computation by aborting the protocol). They also build a two-round MPC protocol that provides guaranteed output delivery.…”

Section: Efficiency Gainsmentioning

confidence: 99%

Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities

Choi

Butler

2019

Security and Communication Networks

View full text Add to dashboard Cite

When two or more parties need to compute a common result while safeguarding their sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled circuits. The traditional enabler of SMC is cryptography, but the significant number of cryptographic operations required results in these techniques being impractical for most real-time, online computations. Trusted execution environments (TEEs) provide hardware-enforced isolation of code and data in use, making them promising candidates for making SMC more tractable. This paper revisits the history of improvements to SMC over the years and considers the possibility of coupling trusted hardware with SMC. This paper also addresses three open challenges: (1) defeating malicious adversaries, (2) mobile-friendly TEE-supported SMC, and (3) a more general coupling of trusted hardware and privacy-preserving computation.

show abstract

Section: Efficiency Gainsmentioning

confidence: 99%

Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities

Choi

Butler

2019

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…We remark that the proof in [ 2 ] also follows this intuition; however, that proof uses specific properties of the (simulator for the) broadcast-model protocol constructed in [ 2 ] (which in turn is based on the protocol from [ 1 ]). Our goal is to provide a generic compiler, which works for any two-round broadcast-model protocol, and so our use of the simulator for the broadcast-model protocol must be black-box.…”

Section: Introductionmentioning

confidence: 98%

“…Two-round MPC protocols in the malicious setting were first explored in [ 37 , 38 ], while recent years have witnessed exciting developments in two-round MPC [ 1 – 5 , 9 – 11 , 15 , 25 , 26 , 31 – 36 , 42 , 49 , 51 , 59 , 60 , 64 ]. The current state of the art can be summarized as follows: Garg and Srinivasan [ 33 ] and Benhamouda and Lin [ 9 ] showed how to balance between the optimal round complexity and minimal cryptographic assumptions for MPC in the broadcast model, by showing that every function can be computed with unanimous abort using two broadcast rounds, assuming two-round oblivious transfer (OT) and tolerating corruptions.…”

Section: Introductionmentioning

confidence: 99%

“…Our results are based on the compiler of Ananth et al [ 2 ], who focused on information-theoretic security of two-round MPC in the honest-majority setting. 3 Ananth et al [ 2 ], initially adjusted the two-round protocol from [ 1 ] to provide information-theoretic security with unanimous abort in the broadcast model (for circuits), and then compiled it to provide security with selective abort over point-to-point channels. 4…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Broadcast-Optimal Two-Round MPC

Cohen

Garay

Zikas

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An intensive effort by the cryptographic community to minimize the round complexity of secure multi-party computation (MPC) has recently led to optimal two-round protocols from minimal assumptions. Most of the proposed solutions, however, make use of a broadcast channel in every round, and it is unclear if the broadcast channel can be replaced by standard point-to-point communication in a round-preserving manner, and if so, at what cost on the resulting security. In this work, we provide a complete characterization of the trade-off between number of broadcast rounds and achievable security level for two-round MPC tolerating arbitrarily many active corruptions. Specifically, we consider all possible combinations of broadcast and point-to-point rounds against the three standard levels of security for maliciously secure MPC protocols, namely, security with identifiable, unanimous, and selective abort. For each of these notions and each combination of broadcast and point-to-point rounds, we provide either a tight feasibility or an infeasibility result of two-round MPC. Our feasibility results hold assuming two-round OT in the CRS model, whereas our impossibility results hold given any correlated randomness.

show abstract

“…In fact, if merely unanimous abort is required, even this setup assumption can be removed [29]. 1 However, as discussed above, in terms of round efficiency, removing the broadcast resource is not for free and one needs to either pay with more rounds to emulate broadcast [27,30], or lessen the obtained security guarantees. However, very few generic ways to trade-off broadcast for weaker security have been proposed.…”

Section: Introductionmentioning

confidence: 99%