Zero Knowledge from the Discrete Logarithm Problem

The talk will present succinct zero-knowledge proofs that require no trusted setup. Specifically, we will focus on Bulletproofs, a proof system that uses a group where the discrete-log problem is difficult. We will work our way from classical sigma protocols to Bulletproofs and explain the capabilities of these new techniques. Along the way we will look at a number of applications where these new proof systems have been put to use.