Strachey Lectures

Oxford University

4.0 (12)
Education

This series covers the Strachey Lectures, a series of termly computer science lectures named after Christopher Strachey, the first Professor of Computation at the University of Oxford. Hosted by the Department of Computer Science, University of Oxford, the Strachey Lectures began in 1995 and have included many distinguished speakers over the years. The Strachey Lectures are generously supported by OxFORD Asset Management.

Nov 5 · Video

Michaelmas Term 2026 with Professor Alastair Beresford: Hiding in plain sight: the promises and pitfalls of secret communication

This lecture explores the topic of secret communication through the design and deployment of CoverDrop, a secure communication system designed in collaboration with The Guardian. The history of secret communication has been driven by the need for both confidentiality and anonymity. Over the last thirty years we’ve seen significant progress in the digital space, with encryption now widely deployed on the web and in personal messaging apps. Protecting the identity of communicating parties is comparatively underexplored, despite the fact that the timing, frequency, and volume of network traffic can often reveal who is talking to whom, even if the communication itself is encrypted. These technological developments also sit at the centre of a wider societal debate: secure communications are simultaneously essential to protect individual autonomy and foster commercial innovation, yet they can also pose serious operational challenges to law enforcement and the oversight of public safety.We will walk through the seven-year journey from our initial research idea to a real-world deployment that now serves as the default channel by which news sources and whistleblowers contact The Guardian. We’ll explore the technical hurdles that arise when providing confidential and plausibly deniable communication inside a news app at scale, and reflect on whether these technologies, and indeed other emerging ideas in the digital landscape, are an overall benefit to society. The Strachey Lectures are generously supported by OxFORD Asset Management
May 27 · Video

Hardening Digital Infrastructure: Two Examples

Trinity Term 2026 Strachey Lecture with Professor Srđan Čapkun, Hardening Digital Infrastructure: Resilient Positioning and Sovereign Smartphone Architectures. Recent global events have underscored how failures in isolation, redundancy, and control can jeopardiseessential digital functions. A critical challenge remains: how do we harden systems for higher resiliency, personal and societal control while maintaining compatibility with existing ecosystems? In this talk, I explore this in two example settings. First, I address the systemic vulnerabilities of current satellite positioning systems. By integrating novel protocols hardened at the physical layer, I demonstrate a path toward a robust, feature-rich, wide-area positioning infrastructure. Second, I introduce a novel security architecture that brings true digital sovereignty to the modern smartphone. This deployable design allows users to run 'several phones in one' (e.g. isolating private and business environments), ensuring that sensitive applications and critical I/O remain protected even if the underlying OS is compromised. Ultimately, these designs return control to users and organisations, fostering a more resilient and free environment for digital innovation.
Feb 26 · Video

An AI stack: from scaling AI workloads to evaluating LLMs

Hilary Term 2026 Strachey Lecture with Professor Ion Stoica, An AI stack: from scaling AI workloads to evaluating LLMs Large language models (LLMs) have taken the world by storm, enabling new applications, intensifying GPU shortages, and raising concerns about the accuracy of their outputs. In this talk, I will present several projects I have worked on to address these challenges. Specifically, I will focus on Ray, a distributed framework for scaling AI workloads, vLLM and SGLang, two high-throughput inference engines for LLMs, and LMArena, a platform for accurate LLM benchmarking. I will conclude with key lessons learned and outline directions for future research.
10/27/2025 · Video

Advances in Garbled Circuits

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.
05/15/2025 · Video

Will Computers prove theorems?

Kevin Buzzard: Will Computers prove theorems? Will computers one day replace human mathematicians? Is this just around the corner, or decades away? Can neural networks spot patterns which humans have missed? Currently language models are great for brainstorming big ideas but are very poor when it comes to details. Can integrating a language model with a theorem prover like Lean solve these problems? Is the modern mathematical literature riddled with errors, and is it feasible to hope that a machine might find and even fix them? Is it possible to teach a computer the proof of Fermat's Last Theorem? And what do mathematicians make of all this? I'll talk about how modern developments in AI and theorem provers are beginning to affect mathematics.
05/15/2025 · Video

Formalizing the Future: Lean’s Impact on Mathematics, Programming, and AI

Leo De Moura: Formalizing the Future: Lean’s Impact on Mathematics, Programming, and AI How can mathematicians, software developers, and AI systems work together with complete confidence in each other’s contributions? The open-source Lean proof assistant and programming language provides an answer, offering a rigorous framework where proofs and programs are machine-checkable, shared, and extended by a broad community of collaborators. By removing the traditional reliance on trust-based verification and manual oversight, Lean not only accelerates research and development but also redefines how we collaborate. In this talk, I will highlight how Lean is being used to tackle challenging problems in mathematics, software verification, and AI research that depends on formally sound reasoning. I will also introduce the Lean Focused Research Organization (FRO), a non-profit dedicated to expanding Lean’s capabilities and community. By showcasing real-world examples, ranging from advanced research projects to industry-driven applications, I illustrate how Lean empowers us to innovate in a more reliable, transparent, and truly collective manner.
03/11/2025 · Video

Privacy, Verification, Robustness: A Cryptographer's perspective on ML

Strachey Lecture: Privacy, Verification, Robustness: A Cryptographer's perspective on ML Cryptographic tools enable the safe use of technology platforms controlled by worst case computationally bounded adversaries.In this talk I will show how cryptographic paradigms and tools can be used to address trust issues in various phases of the machine learning pipeline. We will touch on approaches for achieving privacy, correctness, and robustness in presence of adversaries.
12/02/2024 · Video

From probabilistic bisimulation to representation learning via metrics

Strachey Lecture: From probabilistic bisimulation to representation learning via metrics - Professor Prakash Panangaden Bisimulation is a fundamental equivalence relation in process theory invented by Robin Milner and with an elegant fixed-point definition due to David Park. In this talk I will review the concept of bisimulation and then discuss its probabilistic analogue. This was extended to systems with continuous state spaces. Despite its origin in theoretical work, it has proved to be useful in fields like machine learning, especially reinforcement learning. Surprisingly, it turned out that one could prove a striking theorem: a theorem that pins down exactly what differences one can "see" in process behaviours when two systems are not bisimilar. However, it is questionable whether a concept like equivalence is the right one for quantitative systems. If two systems are almost, but not quite, the same, bisimulation would just say that they are not equivalent. One would like to say in some way that they are "almost" the same. Metric analogues of bisimulation were developed to capture a notion of behavioral similarity rather than outright equivalence. These ideas have been adopted by the machine learning community and a bisimulation-style metric was developed for Markov decision processes. Recent work has shown that variants of these bisimulation metrics can be useful in representation learning. I will tell the tale of this arc of ideas in as accessible a way as possible.

See All (33)

4

out of 5

12 Ratings

Really interesting topics but poor audio and playback

05/05/2020

ElimiNathan

I had high hopes for this, but it is really in a video format that doesn't play back well on my phone, and the audio quality is poor, so it's not something with which I will continue listenning. The topics are brilliant, but I can't learn it if I can't hear it or play it.

This series covers the Strachey Lectures, a series of termly computer science lectures named after Christopher Strachey, the first Professor of Computation at the University of Oxford. Hosted by the Department of Computer Science, University of Oxford, the Strachey Lectures began in 1995 and have included many distinguished speakers over the years. The Strachey Lectures are generously supported by OxFORD Asset Management.