Optimizing Semi-Honest Secure Multiparty Computation for the Internet

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

ACM CCS via YouTube Direct link

Intro

1 of 17

1 of 17

Intro

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

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

  1. 1 Intro
  2. 2 Secure Multiparty Computation
  3. 3 Two Main Paradigms for Secure Computation
  4. 4 Multiparty Concrete Efficiency - The Last Decade
  5. 5 Our Results, Outline
  6. 6 Background - Yao's Garbled Circuit
  7. 7 The BMR Garbled Circuit
  8. 8 Point and Permute
  9. 9 BMR Protocol - Round Complexity
  10. 10 Online Phase - Evaluating BMR Circuit
  11. 11 Honest Minority - OT-Based Protocol
  12. 12 BGW-Based Protocol
  13. 13 Experimentation Details
  14. 14 High Latency - Total Time
  15. 15 High Latency - Online Time
  16. 16 Low Latency - Online Time
  17. 17 Conclusions and Open Questions

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.