Recent Advances in Asynchronous Multi-Party Computation
summary
Claims linear communication C·n with optimal resilience n/3, post‑quantum security, and practical implementation called Velox that runs a 200,000‑gate circuit for n=112 in under two minutes on a LAN; construction uses ACSS with identifiable abort, private send with verifiable delivery (VIFD) plus symmetric keys, Beaver triples generated in king‑led batches with verification, and lightweight primitives (hashes, symmetric crypto); bottleneck is preprocessing, earlier designs had huge additive overhead (n^14) but later work reduces constants by ~10× toward a ~9·C baseline.
AI-written summary · about
chapters (10)
- 0:00Asynchronous MPC advances
- 1:50Asynchronous protocols vs delays
- 2:56Scaling asynchronous MPC
- 8:15Quadratic barriers broken
- 11:13Lightweight crypto protocols
- 16:20Beaver triple generation
- 23:12Optimizing practical efficiency
- 27:12ACSS with abort
- 30:10Velox benchmarking
- 33:01Future challenges
related talks
01h 31mIntroduction to Secure Multi-Party Computation
25mFaster Malicious 2-Party Secure Computation with Online/Offline Dual Execution
23mRecent progress in MPC-in-the-Head protocols
21mA Framework for Efficient Mixed-Protocol Secure Two-Party Computation
37mFrontiers in Cryptography
45mPrice of Active Security in Multiparty Computation
40mPost-Quantum
57mQuantum Computing and the future of cryptography