A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
summary
A mixed-protocol system called ABY framework combines arithmetic sharing, GMW boolean sharing and Yao garbled circuits and converts between them using OT-based multiplication (Gilboa 1999) and OT extension so only symmetric crypto is needed. Public-key multiplications drop in favor of OT, giving roughly two orders of magnitude speedups and conversions that cost a few OTs and messages. Benchmarks (minimum Euclidean distance, PSI) show up to 10× runtime and 20× communication improvements; implementation uses fixed-key AES and is on GitHub.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:40Secure Two-Party Computation
- 0:51Privacy-Preserving Applications
- 1:08An Application Developer's Perspective
- 2:17Motivating Example for Mixed Protocols
- 3:13Mixed-Protocol Secure Computation
- 4:42Roadmap / Our Contributions
- 5:10Multiplication using OT (Gilboa99)
- 6:341 Multiplication using OT Benchmarks
- 7:24The ABY framework
- 12:43Application 1: Minimum Euclidean Distance
- 13:38Application 2: Private Set Intersection
- 14:25Summary
- 14:59Future Work
- 20:273 Efficient Conversions
related talks
45mPrice of Active Security in Multiparty Computation
01h 31mIntroduction to Secure Multi-Party Computation
34mRecent Advances in Asynchronous Multi-Party Computation
22mScalable Zero-Knowledge Protocols From Vector-OLE
25mFaster Malicious 2-Party Secure Computation with Online/Offline Dual Execution
32mNew Techniques for Building Information-Theoretic Asynchronous MPC with Linear Communication
22mNext-Gen PeT: the Future of Multi-Party Computation Software
40mImplementation