Adaptively Secure Garbling with Near Optimal Online Complexity
Offered By: TheIACR via YouTube
Course Description
Overview
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
Related Courses
Algebra & AlgorithmsMoscow Institute of Physics and Technology via Coursera Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi
Institute for Advanced Study via YouTube Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube Undergrad Complexity at CMU - SAT
Ryan O'Donnell via YouTube Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Association for Computing Machinery (ACM) via YouTube