1 h 24 min
Encrypting to a Mathematical Fact | Theoretically Speaking
Cryptography, Computer Science and Information Security seminar by Sanjam Garg, UC Berkeley
Hosted by Simons Institute for the Theory of Computing, UC Berkeley
Tuesday 17:30 Los Angeles (GMT-7)
Recording available
Berkeley, United States
Recording
Abstract
Sanjam Garg explores encryption whose decryption condition is solving a puzzle or proving a mathematical statement, rather than simply possessing a conventional cryptographic key. The lecture traces the development of this idea and describes recent advances that are making such schemes more practical for real applications.
Topics
encryptiondecryption
More from Simons Institute for the Theory of Computing, UC Berkeley
All talksOptimal Spectral Gaps | Richard M. Karp Distinguished Lecture
Oct 14, 2026Ramon van HandelMy Favorite Expanders | Richard M. Karp Distinguished Lecture
Sep 29, 2026Ryan O'DonnellResponsibly Improving AI with Privacy-Sensitive Data: Principles, Theory, and Practice | Richard M. Karp Distinguished Lecture
Video · 1 h 10 min · Captions · Feb 24, 2026Brendan McMahanAlignment Problems in AI Governance
Video · 1 h 5 min · Captions · Feb 5, 2026Rui-Jie Yew