Paper 2021/1530
Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets
Abstract
A zk-SNARK is a powerful cryptographic primitive that provides a
succinct and efficiently checkable argument that the prover has a
witness to a public NP statement, without revealing the witness.
However, in their native form, zk-SNARKs only apply to a secret witness
held by a single party. In practice, a collection of parties often need
to prove a statement where the secret witness is distributed or shared
among them.
We implement and experiment with *collaborative zk-SNARKs*: proofs over
the secrets of multiple, mutually distrusting parties. We construct
these by lifting conventional zk-SNARKs into secure protocols among
Note: Revised in alignment with camera-ready version. Updated with artifact evaluation. Updated acknowledgements.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- zero knowledge multi-party computation implementation
- Contact author(s)
- aozdemir @ cs stanford edu
- History
- 2022-07-16: last of 7 revisions
- 2021-11-22: received
- See all versions
- Short URL
- https://ia.cr/2021/1530
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1530, author = {Alex Ozdemir and Dan Boneh}, title = {Experimenting with Collaborative zk-{SNARKs}: Zero-Knowledge Proofs for Distributed Secrets}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/1530}, year = {2021}, url = {https://eprint.iacr.org/2021/1530} }