ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines

Aranha, DF and Bennedsen, EM and Campanelli, M and Ganesh, C and Orlandi, C and Takahashi, A (2022) ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. In: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2022, 8 March 2022 through 11 March 2022, Virtual, Online, pp. 584-614.

Full text not available from this repository.
Official URL: https://doi.org/10.1007/978-3-030-97121-2_21


We advance the state-of-the art for zero-knowledge commit-and-prove SNARKs (CP-SNARKs). CP-SNARKs are an important class of SNARKs which, using commitments as “glue”, allow to efficiently combine proof systems—e.g., general-purpose SNARKs (an efficient way to prove statements about circuits) and Σ -protocols (an efficient way to prove statements about group operations). Thus, CP-SNARKs allow to efficiently provide zero-knowledge proofs for composite statements such as h= H(gx) for some hash-function H. Our main contribution is providing the first construction of CP-SNARKs where the proof size is succinct in the number of commitments. We achieve our result by providing a general technique to compile Algebraic Holographic Proofs (AHP) (an underlying abstraction used in many modern SNARKs) with special “decomposition” properties into an efficient CP-SNARK. We then show that some of the most efficient AHP constructions—Marlin, PLONK, and Sonic—satisfy our compilation requirements. Our resulting SNARKs achieve universal and updatable reference strings, which are highly desirable features as they greatly reduce the trust needed in the SNARK setup phase.

Item Type: Conference Paper
Publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Science and Business Media Deutschland GmbH
Additional Information: The copyright for this article belongs to the International Association for Cryptologic Research, Springer.
Keywords: Hierarchical systems, Decomposition property; Desirable features; First constructions; Group operations; Proof system; Set-up phase; State of the art; Zero knowledge; Zero-knowledge proofs, Hash functions
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 04 Jul 2022 06:23
Last Modified: 04 Jul 2022 06:23
URI: https://eprints.iisc.ac.in/id/eprint/74249

Actions (login required)

View Item View Item