Adaptively Secure Garbling with Near Optimal Online Complexity

Adaptively Secure Garbling with Near Optimal Online Complexity

TheIACR via YouTube Direct link

Some More Details about the Proof

13 of 14

13 of 14

Some More Details about the Proof

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Adaptively Secure Garbling with Near Optimal Online Complexity

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

  1. 1 Intro
  2. 2 Garbled Circuits
  3. 3 Why is Adaptive security important?
  4. 4 Prior Work
  5. 5 Alternate View of a Boolean Circuit
  6. 6 Garbling the Database - Use a One-time Pad
  7. 7 Updatable Laconic Oblivious Transfer
  8. 8 Using Laconic OT to access the database
  9. 9 Garbling Step Circuits
  10. 10 Simulated Distribution
  11. 11 Hybrid Argument
  12. 12 Going from Real World to Hyb 1
  13. 13 Some More Details about the Proof
  14. 14 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.