Overview
Syllabus
Intro
Secure Multi-Party Computation
The SPDZ setting
MPC in the preprocessing model
Additive secret sharing with MACS
Reconstructed shared values
SPDZ online phase : securely computing arithmetic circuits
Multiplication of secret-shared values
Triple generation: two main approaches
Threshold homomorphic encryption
Instantiating threshold homomorphic
Distributed decryption protocol
Passive triple generation: basic protocol
Active security in two steps
Zero knowledge proofs in SPDZ
Proving knowledge of short preimages
Variations on the basic SPDZ protocol
Where can we hope to do better?
Improving zero knowledge proofs
A step further removing zero knowledge proofs?
Noise drowning in distributed decryption
Alternative approach: non-interactive triploma generation
Conclusion
Taught by
Simons Institute