Towards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
summary
A compiler collapses a nonconstant-round secret-sharing MPC into a five-round MPC in the random oracle model, secure against fully malicious adversaries up to t < n/3 (extendable to 1−ε with more rounds and OTs), while keeping communication O(C·k) plus depth-dependent factors; it builds per-party garbled circuits whose first-round outputs are reconstruction-only message protocol sharings used to derive next-round wire labels, instantiates with DN and GPS2022 packed techniques (uses packed secret sharing and freeXOR/compact commitments in ROM), adds cut-and-choose/MACs for malicious GC, and incurs higher local computation (roughly an n factor) and some n^3/n^4 lower-order terms.
AI-written summary · about
chapters (10)
- 0:00Round collapsing in MPC
- 1:31MPC communication and rounds
- 5:08Main theorem and corruption thresholds
- 8:01Yao garbled circuits and BMR
- 10:09Compiling nonconstant round protocols
- 14:53Reconstruction-only message protocols
- 21:55Security intuition and DN protocol
- 24:03Packed secret sharing and dishonest majority
- 25:09Future directions and open problems
- 28:36Q&A
related talks
01h 08mSecure Computation 1
01h 02mConditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds
28mTwo Round MPC via Multi-Key FHE
58mSecure Multiparty Computation I
26mEfficient Multiparty Protocols via Log-Depth Threshold Formulae
40mApplied MPC
01h 03mClosing Keynote Day 2
01h 03mSecure Computation 2