Cryptographic proofs aim to both mimic and significantly expand upon the capabilities of traditional mathematical proofs. In particular, cryptographic proofs can achieve the seemingly impossible properties of succinctness (proofs that are short and fast to verify) and zero knowledge (proofs that hide everything except the truthfulness of the statement). Since their inception in the 80s, cryptographic proofs have enjoyed a strong interplay with theoretical CS. In recent years, our theoretical understanding of cryptographic proofs has greatly improved with several breakthrough results. On the practical side, cryptographic proofs are being put to real-world use thanks to the remarkable improvements in proof generation time. In addition, they are becoming a vital tool in the world of blockchains, which further accelerates the pace of development.

Several grand challenges remain, both in the theory and practice of cryptographic proof systems. This program will bring together researchers from academia and industry to explore these challenges.

If you require special accommodation, please contact our access coordinator at simonsevents [at] berkeley.edu with as much advance notice as possible.