Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
We present a new zero-knowledge succinct argument of knowledge (zkSNARK) scheme for Rank-1 Constraint Satisfaction (RICS), a widely deployed NP-complete language that generalizes arithmetic circuit satisfiability. By instantiating with different commitment schemes, we obtain several zkSNARKs where t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Sciendo
2022
|
| Subjects: | |
| Online Access: | https://doaj.org/article/13cf5c636d8b4475a700baa837169d0c |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We present a new zero-knowledge succinct argument of knowledge (zkSNARK) scheme for Rank-1 Constraint Satisfaction (RICS), a widely deployed NP-complete language that generalizes arithmetic circuit satisfiability. By instantiating with different commitment schemes, we obtain several zkSNARKs where the verifier’s costs and the proof size range from O(log2 N) to O(N)O\left( {\sqrt N } \right) depending on the underlying polynomial commitment schemes when applied to an N-gate arithmetic circuit. All these schemes do not require a trusted setup. It is plausibly post-quantum secure when instantiated with a secure collision-resistant hash function. We report on experiments for evaluating the performance of our proposed system. For instance, for verifying a SHA-256 preimage (less than 23k AND gates) in zero-knowledge with 128 bits security, the proof size is less than 150kB and the verification time is less than 11ms, both competitive to existing systems. |
|---|