Concurrent Secure Computation with Optimal Query Complexity

Concurrent Secure Computation with Optimal Query Complexity

TheIACR via YouTube Direct link

Concurrent Zero Knowledge

13 of 17

13 of 17

Concurrent Zero Knowledge

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Concurrent Secure Computation with Optimal Query Complexity

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

  1. 1 Intro
  2. 2 Concurrent Self-Composition
  3. 3 Circumventing Impossibility Results
  4. 4 Quantifying Security Loss
  5. 5 Multiple Ideal Query (MIQ) Model
  6. 6 Meaningfulness of MIQ Model
  7. 7 Prior Work: Upper Bound
  8. 8 Apply GMW Paradigm to Concurrent Setting?
  9. 9 How Simulators Work
  10. 10 Core Problem of Concurrent Simulation
  11. 11 MIQ to the Rescue
  12. 12 Improving Query Complexity k
  13. 13 Concurrent Zero Knowledge
  14. 14 Solution: Recursive Rewinds
  15. 15 Precise Simulation
  16. 16 Our Strategy
  17. 17 Static Adversaries

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.