Collaborative zk-SNARKs - Proving as One over Distributed Secrets

Learn about collaborative zk-SNARKs through this 56-minute conference talk that explores multi-prover extensions of zero-knowledge succinct non-interactive arguments of knowledge. Discover how multiple mutually distrustful provers, each holding private inputs, can jointly generate zk-SNARKs that attest to computational correctness over their collective secrets. Examine the common template used in recent efficient constructions, which involves designing secure multiparty computation (MPC) protocols that emulate zk-SNARK prover behavior while avoiding non-black-box use of cryptographic primitives. Survey the framework introduced by Ozdemir and Boneh (USENIX'22) and explore recent advances in both the design and implementation of collaborative zk-SNARK protocols, gaining insights into this emerging area of cryptographic research that enables privacy-preserving collaborative computation.