The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

Explore the intricacies of perfect Multi-Party Computation (MPC) with active security and optimal resiliency in this 26-minute IEEE conference talk. Delve into information-theoretic aspects, constant round complexity, and recent developments in the field. Learn about the BGW protocol for degree-2 polynomials, techniques for trading errors with erasures, and the concept of second-level multiplication. Examine protocol folding, the reduction of binary degree-2 to arithmetic, and the impossibility of 3-round T=n/4 protocols. Investigate Verifiable Secret Sharing (VSS) and its relation to MPC, as well as the process of protocol chopping. Gain insights into the analysis of MPC guarantees and VSS properties, ultimately understanding the landscape of perfect MPC protocols.

Intro
Information-Theoretic (Perfect)
Constant Round Complex
Recent Developments
Our Results
Starting point: BGW for deg-2
Trading errors with erasures
Second-Level Multiplication
Protocol Folding
Are We Done?
Reducing Binary deg-2 to Arithmetic
Impossibility of 3-round T=n/4 pro
Verifiable Secret Sharing CGMA
Chopping a Protocol
Analysis: Properties of f + MPC gua
MPC and VSS
The Landscape of Perfect