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:	zksnark verifiable computation zero-knowledge proof polynomial commitment Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/13cf5c636d8b4475a700baa837169d0c
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:13cf5c636d8b4475a700baa837169d0c
record_format	dspace
spelling	oai:doaj.org-article:13cf5c636d8b4475a700baa837169d0c2021-12-05T14:11:10ZPolaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier2299-098410.2478/popets-2022-0027https://doaj.org/article/13cf5c636d8b4475a700baa837169d0c2022-01-01T00:00:00Zhttps://doi.org/10.2478/popets-2022-0027https://doaj.org/toc/2299-0984We 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.Fu ShihuiGong GuangSciendoarticlezksnarkverifiable computationzero-knowledge proofpolynomial commitmentEthicsBJ1-1725Electronic computers. Computer scienceQA75.5-76.95ENProceedings on Privacy Enhancing Technologies, Vol 2022, Iss 1, Pp 544-564 (2022)
institution	DOAJ
collection	DOAJ
language	EN
topic	zksnark verifiable computation zero-knowledge proof polynomial commitment Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95
spellingShingle	zksnark verifiable computation zero-knowledge proof polynomial commitment Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95 Fu Shihui Gong Guang Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
description	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.
format	article
author	Fu Shihui Gong Guang
author_facet	Fu Shihui Gong Guang
author_sort	Fu Shihui
title	Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
title_short	Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
title_full	Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
title_fullStr	Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
title_full_unstemmed	Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
title_sort	polaris: transparent succinct zero-knowledge arguments for r1cs with efficient verifier
publisher	Sciendo
publishDate	2022
url	https://doaj.org/article/13cf5c636d8b4475a700baa837169d0c
work_keys_str_mv	AT fushihui polaristransparentsuccinctzeroknowledgeargumentsforr1cswithefficientverifier AT gongguang polaristransparentsuccinctzeroknowledgeargumentsforr1cswithefficientverifier
_version_	1718371282004738048

Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier

Ejemplares similares