Back to Search
Start Over
Delegable zk-SNARKs with proxies.
- Source :
- Frontiers of Computer Science; Oct2024, Vol. 18 Issue 5, p1-17, 17p
- Publication Year :
- 2024
-
Abstract
- In this paper, we propose the concept of delegable zero knowledge succinct non-interactive arguments of knowledge (zk-SNARKs). The delegable zk-SNARK is parameterized by (μ,k,k′,k″). The delegable property of zk-SNARKs allows the prover to delegate its proving ability to μ proxies. Any k honest proxies are able to generate the correct proof for a statement, but the collusion of less than k proxies does not obtain information about the witness of the statement. We also define k′-soundness and k″-zero knowledge by taking into consider of multi-proxies. We propose a construction of (μ,2t + 1,t,t)- delegable zk-SNARK for the NPC language of arithmetic circuit satisfiability. Our delegable zk-SNARK stems from Groth’s zk-SNARK scheme (Groth16). We take advantage of the additive and multiplicative properties of polynomial-based secret sharing schemes to achieve delegation for zk-SNARK. Our secret sharing scheme works well with the pairing groups so that the nice succinct properties of Groth’s zk-SNARK scheme are preserved, while augmenting the delegable property and keeping soundness and zero-knowledge in the scenario of multi-proxies. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 20952228
- Volume :
- 18
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- Frontiers of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 174454160
- Full Text :
- https://doi.org/10.1007/s11704-023-2782-9