Speaker:Jonathan Bootle

Title

How to check whether somebody is telling the truth: Designing efficient probabilistic proof systems

Abstract

Probabilistic proof systems allow a sceptical verifier to delegate a vast computation to an untrusted prover, who sends the verifier a proof attesting to the correctness of their output. Incredibly, the length of the proof, and the time taken to verify it, can be a fraction of the size of the computation being proved.

In this talk, I will explain the basics of probabilistic proof systems, some of my past research on the topic, and ideas for future research in this space.

About Jonathan Bootle

Jonathan Bootle is a cryptography researcher, currently working on efficient zero-knowledge proofs, especially those based on lattice assumptions or error-correcting codes. He is also interested in number theory, game theory, and quantum information theory. He is currently working as a researcher in the Foundational Cryptography group at IBM Research, Zürich.