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.
All content for Strachey Lectures is the property of Oxford University and is served directly from their servers
with no modification, redirects, or rehosting. The podcast is not affiliated with or endorsed by Podjoint in any way.
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.
Strachey Lecture: How Can Algorithms Help to Protect our Privacy
Strachey Lectures
54 minutes
1 year ago
Strachey Lecture: How Can Algorithms Help to Protect our Privacy
In this term's Strachey lecture, Professor Monika Henzinger gives an introduction to differential privacy with an emphasis on differential private algorithms that can handle changing input data. Decisions are increasingly automated using rules that were learnt from personal data. Thus, it is important to guarantee that the privacy of the data is protected during the learning process. To formalize the notion of an algorithm that protects the privacy of its data, differential privacy was introduced. It is a rigorous mathematical definition to analyze the privacy properties of an algorithm – or the lack thereof. In this talk I will give an introduction to differential privacy with an emphasis on differential private algorithms that can handle changing input data.
Monika Henzinger is a professor of Computer Science at the Institute of Science and Technology Austria (ISTA). She holds a PhD in computer science from Princeton University (New Jersey, USA), and has been the head of research at Google and a professor of computer science at EPFL and the University of Vienna.
Monika Henzinger is an ACM and EATCS Fellow and a member of the Austrian Academy of Sciences and the German National Academy of Sciences Leopoldina. She has received several awards, including an honorary doctorate from TU Dortmund University, Two ERC Advanced Grant, the Leopoldina Carus Medal, and the Wittgensteinpreis, the highest science award of Austria.
The Strachey Lectures are generously supported by OxFORD Asset Management
Strachey Lectures
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.
