Price of Active Security in Multiparty Computation

on YouTube ↗45m

" summary

Shows a compiler that turns any black-box passive secure multiplication into an actively secure MPC with constant overhead per multiplication (provably constant invocations of the passive gadget). Implements a Yao-style variant that gets ≈2× calls for large fields by attaching succinct proofs and a certified-OT primitive, and demonstrates scaling: a thousand-party distributed RSA generation runs passive in ~4 minutes and active (proofs) in ~22 minutes with per-party comms ~150 MB.

AI-written summary · about

" chapters (10)

1. 0:00Intro
2. 0:37Secure Multiparty Computation (MPC)
3. 1:51MPC design methodology
4. 12:54Combining the ingredients
5. 15:23Efficiency of the IPS paradigm
6. 17:30Our Approach
7. 20:19Leviosa [HIMV19] vs Overdrive [KPR18]
8. 25:02Passive Case: Yao's protocol
9. 25:58Active 2-party computation AFHIV20
10. 33:35GMW Paradigm

" related talks

• 01h 08mSecure Computation 1Peter Scholl · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 31mIntroduction to Secure Multi-Party ComputationAhto Truu · ACCU 2023
• 51mDistributed Zero-Knowledge Proofs and Applications to Secure ComputationElette Boyle · 4th ZKProof Workshop (Home Edition)
• 40mApplied MPCNigel Smart · RSAC 2021
• 01h 03mSecure Computation 2Elette Boyle · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 33mInteraction Preserving Compilers for Secure ComputationGiulio Malavolta, Nico Döttling, Vipul Goyal, Justin Raizes · ITCS 2022
• 05mπMPC: Automatic Security Proofs for MPC ProtocolsJoseph P. Near, Mako P. Bates · LAFI 2023
• 21mA Framework for Efficient Mixed-Protocol Secure Two-Party ComputationThomas Schneider · Securing Computation (Simons Institute, June 2015)