Encrypting to a Mathematical Fact | Theoretically Speaking

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.