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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Fu Shihui, Gong Guang
Formato: article
Lenguaje:EN
Publicado: Sciendo 2022
Materias:
Acceso en línea:https://doaj.org/article/13cf5c636d8b4475a700baa837169d0c
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!