Garbled Circuits II
summary
Garbled Circuits II presents advances in Yao-style garbled circuit techniques for secure two-party computation, focusing on optimizations and recent protocol improvements. It covers concrete cryptographic tools and engineering approaches to make garbled-circuit based protocols more efficient and practical for real-world use.
AI-written summary · about
chapters (20)
- 0:00Intro
- 0:20Online Rate 1 for TM's?
- 2:27Reusable Randomized Encoding
- 3:34Gadget: Attribute Encryption [SW05, GPSW06] Reusable RE for the function
- 5:29FHE+ Attribute Enc= Reusable-GC
- 9:08FHE+ Attribute Ence Reusable-GC
- 12:03Implementing Attribute Encryption [Gorbunov VaikuntanathanWee13]
- 18:18Complexity so far...
- 19:09Succinct RE
- 21:29Proof Idea (over-simplified) BGLPT15
- 24:25Take Home Message
- 25:04Summary
- 28:57The Archetypical Story
- 29:41Encoding the Functionality
- 30:38Encoding the Honest Parties
- 31:14Encoding the Adversary
- 32:50F-KDM Security
- 33:17From G-KDM to F-KDM
- 34:14Assume E is G-KDM secure
- 39:55Open Questions • Adaptive security: Online Input depends on offline part
related talks
01h 03mBeyond Boolean Circuits in Garbled Circuits
51mNew Ways to Garble Arithmetic Circuits
35mA Unified Framework for Succinct Garbling from Homomorphic Secret Sharing
28mNew Advances in Secure RAM Computation
33mBitGC: Garbled Circuits with 1 Bit per Gate
10mCryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation
32mQuantum Obfuscation of Classical Circuits
01h 08mSecure Computation 1