Encrypting to a Mathematical Fact - Theoretically Speaking

When people think of encryption, they typically imagine a plaintext being encrypted so that only someone with the correct cryptographic key can decrypt it. In this talk, Sanjam Garg (UC Berkeley) will discuss a different kind of encryption scheme, where a plaintext can be encrypted to a puzzle or, more generally, to any mathematical fact. Anyone who can solve the puzzle or prove the fact can recover the plaintext. This talk traces the evolution of this idea and highlights recent developments that are making such techniques increasingly practical and relevant to real-world deployments.

Register at weblink