About this episode
Professor Rafail Ostrovsky discusses the advancements in Garbled Circuits and their implications for secure computation.
MT25 Strachey Lecture - Professor Rafail Ostrovsky: Advances in Garbled Circuits Nearly 40 years ago, Andy Yao proposed the construction of “Garbled Circuits,” which had an enormous impact on the field of secure computation -- both in theory and in practice. In Garbled Circuits, two parties agree on a Boolean circuit that they want to evaluate, where both parties have partial, disjoint inputs to the circuit, and neither party is willing to disclose to the other party anything but the output. In this talk, I will survey the state of the art for garbling schemes, including computing with Garbled Random Access Memory, the so-called GRAM constructions that were invented by Lu and Ostrovsky in 2013, as well as more recent progress, including the GRAM paper by Heath, Kolesnikov and Ostrovsky, which received the best paper award in Eurocrypt 2022. I will also discuss Garbled Circuits in the malicious setting, where parties try to deviate arbitrarily from the prescribed protocol execution to gain additional information, and will review some of the latest advances in this area. The talk will be self-contained and accessible to the general audience.
People in this episode
Host: Oxford University
Guest: Professor Rafail Ostrovsky
Topics covered
- Garbled Circuits
- secure computation
- Boolean circuit evaluation
- Garbled Random Access Memory
- malicious setting
- protocol execution
Keywords
- Garbled Circuits
- secure computation
- Boolean circuit
- Garbled Random Access Memory
- GRAM constructions
- malicious setting
- protocol execution
Mentioned in this episode
Organizations: Eurocrypt
More episodes of Strachey Lectures
- Hardening Digital Infrastructure: Two Examples · May 27, 2026 · 1h 2m
- An AI stack: from scaling AI workloads to evaluating LLMs · February 26, 2026 · 56 min
- Will Computers prove theorems? · May 15, 2025 · 46 min
- Formalizing the Future: Lean’s Impact on Mathematics, Programming, and AI · May 15, 2025 · 47 min
- Privacy, Verification, Robustness: A Cryptographer's perspective on ML · March 11, 2025 · 1h 4m
- From probabilistic bisimulation to representation learning via metrics · December 2, 2024 · 55 min
Explore listener stats, chart rankings, contacts and more on the Strachey Lectures podcast page.