Dumbo-MPC: Efficient Fully Asynchronous MPC with Optimal Resilience
summary
Dumbo-MPC claims fully asynchronous MPC with all-phase G.O.D. and optimal resilience t < n/3 by combining a fast optimistic path with a fully asynchronous pessimistic fallback. It builds a novel dual-mode offline triple generator that uses an efficient zk proof over compact KZG commitments to reduce product degree from 2t to t. Implementation on up to 31 AWS nodes yields 349 triples/sec in the good case and 94 triples/sec in the pessimistic case, about 6× and 2× faster than GS23 respectively.
AI-written summary · about
chapters (9)
- 0:00Dumbo-MPC introduction
- 1:12Need for async MPC
- 2:19Sync MPC challenges
- 3:24Recent sync MPC limits
- 5:13Prior async MPC inefficiencies
- 5:55Dumbo-MPC design
- 7:23Pessimistic path details
- 8:49Performance results
- 9:34Dumbo-MPC contributions
related talks
40mApplied MPC
01h 08mSecure Computation 1
58mThe Communication Complexity Landscape of Information-theoretic MPC
29mTowards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
35mOblivious RAM for MPC
40mCryptography in Distributed Systems
01h 02mConditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds
16mUnlocking Cross-Organizational Insights: Practical MPC for Cloud-Based Data Analytics