Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting

ePrint Report: Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting

Moumita Dutta, Chaya Ganesh, Neha Jawalkar

We propose protocols in the Compressed Sigma Protocol framework that achieve a succinct verifier. Towards this, we construct a new inner product argument and cast it in the Compressed Sigma Protocol (CSP) framework as a protocol for opening a committed linear form, achieving logarithmic verification.


We then use our succinct-verifier CSP to construct a zero-knowledge argument for circuit satisfiability (under the …

argument chaya eprint report framework product protocol protocols report sigma verification