Zero-knowledge Succinct Arguments with a Linear-time Prover

Siqi Liu


Improving the running time of the prover is a central goal in the area of succinct arguments. In this talk we will trace through a line of works [BCGGHJ17, BCG20, BCL20] that successfully construct succinct arguments that have linear-time provers and are also zero-knowledge. The result is a direct consequence of a new interactive oracle proof (IOP) that achieves linear-time proving, polylogrihtmic verification, and zero knowledge. We will focus on the construction of this IOP in this talk.

Time and Place

Tuesday, April 27, 12:00pm