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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Sciendo
2022
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/13cf5c636d8b4475a700baa837169d0c |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Soyez le premier à ajouter un commentaire!