Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ

TheIACR via YouTube Direct link

Estimated Running Time

16 of 17

16 of 17

Estimated Running Time

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Multiparty Computation
  3. 3 The Setting in This Work
  4. 4 Two Main Approaches to (Efficient) Secure Computation
  5. 5 Two-Party Concretely Efficient
  6. 6 Multiparty Concretely Efficient
  7. 7 State of the Art
  8. 8 The Problem
  9. 9 [BMR 90] - Offline
  10. 10 Our Protocol
  11. 11 Shrinking the Garbling Circuit
  12. 12 Problem 2 - Inconsistency of Masks
  13. 13 Solution
  14. 14 Further Optimizations
  15. 15 Protocol Overview
  16. 16 Estimated Running Time
  17. 17 Conclusion

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.