InfoSec Seminar: Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability

Speaker: Jonathan Bootle

Date/Time: 23-Nov-2017, 16:00 UTC

Venue: Roberts 508



Zero-knowledge proofs and arguments allow a prover to convince a verifier that some statement is true, without giving away any secret knowledge. However, for the prover, producing the proof has previously always incurred some overhead costs relative to the size of the statement. Recent work by Bootle et al (, to appear at Asiacrypt2017) gives zero-knowledge arguments of knowledge with only a constant computational overhead for the prover. The arguments also have sub-linear communication and verification time. In this talk, I will explain the key ideas behind the efficiency improvement.


I am a PhD candidate in the area of cryptography, working under the supervision of Dr Jens Groth and Dr Sarah Meiklejohn. I am currently working on efficient zero-knowledge proofs. More specifically, I am looking at zero-knowledge membership proofs. I am also interested in lattices and post-quantum cryptography.

Add to Calendar

This page was last modified on 27 Mar 2014.