The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 17

1 of 17

Intro

Class Central Classrooms beta

YouTube playlists 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. 1 Intro
  2. 2 Information-Theoretic (Perfect)
  3. 3 Constant Round Complex
  4. 4 Recent Developments
  5. 5 Our Results
  6. 6 Starting point: BGW for deg-2
  7. 7 Trading errors with erasures
  8. 8 Second-Level Multiplication
  9. 9 Protocol Folding
  10. 10 Are We Done?
  11. 11 Reducing Binary deg-2 to Arithmetic
  12. 12 Impossibility of 3-round T=n/4 pro
  13. 13 Verifiable Secret Sharing CGMA
  14. 14 Chopping a Protocol
  15. 15 Analysis: Properties of f + MPC gua
  16. 16 MPC and VSS
  17. 17 The Landscape of Perfect

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.