This speaker series is made possible by an anonymous charitable donation in memory of cypherpunks and privacy advocates Len Sassaman, Hugh Daniel, Hal Finney, and Caspar Bowden.
View the list of past and upcoming speakers
Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets
Alex Ozdemir, Stanford University
[Download (MP4)] [View on Youtube]
October 21, 2024 1:30pm, in DC 1304 and Zoom
Abstract
We introduce collaborative zk-SNARKs: zero-knowledge proofs about secret data distributed among different parties. These generalize conventional zk-SNARKs, which apply to secret data held by one party. Since collaborative zk-SNARKs *do not* require secrets to be centralized to create a proof, they might allow for distributed systems with better privacy properties.
We define this new primitive, describe an approach for constructing it, give concrete constructions, implement, and evaluate.
We find a surprising fact: despite the fact that creating a collaborative proof requires a secure multi-party protocol, it can often be created in nearly the same time as a conventional (single-prover) proof.
This work was presented at Usenix Security in 2022.
Bio
Alex Ozdemir is a PhD student at Stanford advised by Dan Boneh and Clark Barrett. He studies the full stack of programmable cryptography using ideas from cryptography, programming languages, and formal methods. Programmable cryptosystems (such as zero-knowledge proofs, multi-party computation, homomorphic encryption, ...) are tools for complex systems that are private and secure---without cryptographic expertise.
