MPC Problem & Yao's Garbled Circuits
Understand 2-party secure computation via garbled Boolean circuits.
The Secure Multi-Party Computation Problem
MPC allows n parties, each holding private input x_i, to jointly compute f(x_1,...,x_n) without revealing their inputs to each other — as if a trusted third party computed it.
Classic Example: Millionaires' Problem
Yao's 1982 Millionaires' Problem: Alice and Bob want to know who is richer without disclosing their wealth. No trusted third party. MPC solves this with cryptographic guarantees.
All lessons in this course
- MPC Problem & Yao's Garbled Circuits
- GMW Protocol & Oblivious Transfer
- SPDZ & Arithmetic MPC over Secret Shares
- MPC Applications: Private Set Intersection & ML