SPDZ & Arithmetic MPC over Secret Shares
Perform joint addition and multiplication on secret-shared integers.
Arithmetic vs Boolean MPC
Boolean MPC works on bits (XOR/AND). Arithmetic MPC works on integers or field elements, supporting addition and multiplication directly. Better for ML and statistics applications.
Additive Secret Sharing over Z_p
A value x ∈ Z_p is shared as x = x_1 + x_2 + ... + x_n mod p. Addition of shared values is free: each party adds their shares locally. No communication needed.
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