Completed
Verifiable Secret Sharing CGMA
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Information-Theoretic (Perfect)
- 3 Constant Round Complex
- 4 Recent Developments
- 5 Our Results
- 6 Starting point: BGW for deg-2
- 7 Trading errors with erasures
- 8 Second-Level Multiplication
- 9 Protocol Folding
- 10 Are We Done?
- 11 Reducing Binary deg-2 to Arithmetic
- 12 Impossibility of 3-round T=n/4 pro
- 13 Verifiable Secret Sharing CGMA
- 14 Chopping a Protocol
- 15 Analysis: Properties of f + MPC gua
- 16 MPC and VSS
- 17 The Landscape of Perfect
