Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers

IEEE Symposium on Security and Privacy via YouTube Direct link

Efficiency

12 of 13

12 of 13

Efficiency

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers

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

  1. 1 Intro
  2. 2 Secure Multi-Party Computation (MPC)
  3. 3 Research/Development Stack for MPC
  4. 4 Focus of This Paper
  5. 5 Why hash functions?
  6. 6 Performance to hash short strings (128 bits)
  7. 7 Understand the security provided by MPC implementations
  8. 8 Our Results Give "end-to-end" security proofs for protocols based on fixed-key block ciphers
  9. 9 Correlation robustness (informal)
  10. 10 Fixed-key AES and the RPM
  11. 11 Constructing a CR hash function
  12. 12 Efficiency
  13. 13 Follow-up work

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.