Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Adaptively Secure Garbling with Near Optimal Online Complexity

TheIACR via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking paper on adaptively secure garbling presented at Eurocrypt 2018. Delve into the importance of adaptive security in garbled circuits and discover an innovative approach using updatable laconic oblivious transfer. Learn about the alternate view of Boolean circuits, the one-time pad technique for database garbling, and the process of garbling step circuits. Examine the simulated distribution, hybrid argument, and the transition from the real world to Hybrid 1. Gain insights into the proof details and understand the significant implications of this research in the field of cryptography.

Syllabus

Intro
Garbled Circuits
Why is Adaptive security important?
Prior Work
Alternate View of a Boolean Circuit
Garbling the Database - Use a One-time Pad
Updatable Laconic Oblivious Transfer
Using Laconic OT to access the database
Garbling Step Circuits
Simulated Distribution
Hybrid Argument
Going from Real World to Hyb 1
Some More Details about the Proof
Conclusion

Taught by

TheIACR

Reviews

Start your review of Adaptively Secure Garbling with Near Optimal Online Complexity

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.