Collaborative zk-SNARKs: Proving as One over Distributed Secrets

Channel:

Simons Institute for the Theory of Computing

Subscribers:

69,400

Published on July 18, 2025 12:00:00 AM ● Video Link: https://www.youtube.com/watch?v=piF_3eUT5Do

Duration: 0:00

77 views

0

Aarushi Goel (Purdue University)
https://simons.berkeley.edu/talks/aarushi-goel-purdue-university-2025-07-18
Proofs

Collaborative zk-SNARKs, introduced by Ozdemir and Boneh (USENIX’22), are a multi-prover extension of zk-SNARKs in which multiple mutually distrustful provers, each holding a private input, jointly generate a zk-SNARK that attests to the correctness of a computation over their collective secrets.

A sequence of recent works has proposed efficient constructions of collaborative zk-SNARKs following a common template: designing secure multiparty computation (MPC) protocols that emulate the behavior of a zk-SNARK prover, while avoiding non-black-box use of cryptographic primitives.

In this talk, I will survey this framework and highlight recent advances in the design and implementation of collaborative zk-SNARK protocols.