TCS+ talk *this week*: Wednesday, March 19, Tom Gur, University of Cambridge
Clement Canonne
This is a reminder that the next TCS+ talk is taking place this week, Wednesday, March 19th at 1:00 PM Eastern Time (10:00 AM Pacific Time, 18:00 Central European Time, 17:00 UTC). The speakers' slides will be made available at https://sites.google.com/view/tcsplus/welcome/past-talks after the talk.
If you’d like to join the Zoom talk, please sign up using the form at https://sites.google.com/view/tcsplus/welcome/next-tcs-talk. The talk will also be recorded and posted shortly afterwards on our YouTube channel, here: http://www.youtube.com/user/TCSplusSeminars.
Hoping to see you all there,
The organizers
-------------------------------
Speaker: Tom Gur (University of Cambridge)
Title: A Zero-Knowledge PCP Theorem
Abstract: We show that every language in NP admits a probabilistically checkable proof (PCP) of polynomial length, which can be verified by only reading O(1) bits while revealing no information other than the correctness of the statement. This can be viewed as a zero-knowledge version of the PCP theorem, resolving a problem that was open since the seminal work of Kilian, Petrank and Tardos (STOC 1997).
Based on STOC 2024 and STOC 2025 papers, joint with Jack O’Connor and Nicholas Spooner.