Broadcast-Optimal Two-Round MPC

Explore a comprehensive analysis of broadcast-optimal two-round Secure Multiparty Computation (MPC) in this 22-minute conference talk presented at Eurocrypt 2020. Delve into the paper by Ran Cohen, Juan Garay, and Vassilis Zikas, examining various aspects of security with abort and the minimum rounds required for MPC. Investigate impossibility results, lower bounds, and feasibility outcomes for 2-round MPC without broadcast. Gain insights into the structure of 2-round protocols, proof ideas, and the implications of unanimous and identifiable abort. Enhance your understanding of this critical topic in cryptography and its practical applications.

Intro
Secure Multiparty Computation
Many Flavors of Security with Abort
How many rounds needed for MPC?
Main Question
2-Round MPC w/o Broadcast
Part 1: Impossibility Results
Our Results: Lower Bounds
The function for the lower bound
1 Unanimous abort = 2nd round is BC
2 Identifiable abort
Part 2: Feasibility Results
Our Results: Feasibility
Structure of 2-round protocols
Proof idea
Summary