ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines

Diego F. Aranha; Emil Madsen Bennedsen; Matteo Campanelli; Chaya Ganesh; Claudio Orlandi; Akira Takahashi

doi:10.1007/978-3-030-97121-2_21

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines

Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I
Editors	Goichiro Hanaoka, Junji Shikata, Yohei Watanabe
Publisher	Springer, Cham
Pages	584-614
Number of pages	31
Volume	13177
ISBN (Electronic)	978-3-030-97121-2
ISBN (Print)	978-3-030-97120-5
DOIs	https://doi.org/10.1007/978-3-030-97121-2_21
Publication status	Published - 27 Feb 2022
Event	The 25th International Conference on Practice and Theory of Public-Key Cryptography, 2022 - Online Duration: 8 Mar 2022 → 11 Mar 2022 Conference number: 25 https://pkc.iacr.org/2022/

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Cham
Volume	13177
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	The 25th International Conference on Practice and Theory of Public-Key Cryptography, 2022
Abbreviated title	PKC 2022
Period	8/03/22 → 11/03/22
Internet address	https://pkc.iacr.org/2022/

Access to Document

10.1007/978-3-030-97121-2_21Licence: All Rights Reserved

https://link.springer.com/chapter/10.1007/978-3-030-97121-2_21Licence: All Rights Reserved

Cite this

Aranha, D. F., Bennedsen, E. M., Campanelli, M., Ganesh, C., Orlandi, C., & Takahashi, A. (2022). ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. In G. Hanaoka, J. Shikata, & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (Vol. 13177, pp. 584-614). (Lecture Notes in Computer Science; Vol. 13177). Springer, Cham. https://doi.org/10.1007/978-3-030-97121-2_21

Aranha, Diego F. ; Bennedsen, Emil Madsen ; Campanelli, Matteo et al. / ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I. editor / Goichiro Hanaoka ; Junji Shikata ; Yohei Watanabe. Vol. 13177 Springer, Cham, 2022. pp. 584-614 (Lecture Notes in Computer Science).

@inproceedings{c669a0a6a68d4604808207538470158c,

title = "ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines",

abstract = "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.",

author = "Aranha, {Diego F.} and Bennedsen, {Emil Madsen} and Matteo Campanelli and Chaya Ganesh and Claudio Orlandi and Akira Takahashi",

note = "Funding Information: Acknowledgments. The authors are grateful for Sean Bowe, Ben Fisch, Ariel Gabi-zon, and Mary Maller for clarifying the details of their works. We thank the anonymous reviewers of PKC 2022 for helpful comments. This work has been supported by: the Concordium Blockchain Research Center, Aarhus University, Denmark; the Carlsberg Foundation under the Semper Ardens Research Project CF18-112 (BCM); the European Research Council (ERC) under the European Unions{\textquoteright}s Horizon 2020 research and innovation programme under grant agreement No 803096 (SPEC). Funding Information: The authors are grateful for Sean Bowe, Ben Fisch, Ariel Gabizon, and Mary Maller for clarifying the details of their works. We thank the anonymous reviewers of PKC 2022 for helpful comments. This work has been supported by: the Concordium Blockchain Research Center, Aarhus University, Denmark; the Carlsberg Foundation under the Semper Ardens Research Project CF18-112 (BCM); the European Research Council (ERC) under the European Unions?s Horizon 2020 research and innovation programme under grant agreement No 803096 (SPEC). Publisher Copyright: {\textcopyright} 2022, International Association for Cryptologic Research.; The 25th International Conference on Practice and Theory of Public-Key Cryptography, 2022, PKC 2022 ; Conference date: 08-03-2022 Through 11-03-2022",

year = "2022",

month = feb,

day = "27",

doi = "10.1007/978-3-030-97121-2_21",

language = "English",

isbn = "978-3-030-97120-5",

volume = "13177",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Cham",

pages = "584--614",

editor = "Goichiro Hanaoka and Junji Shikata and Yohei Watanabe",

booktitle = "Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I",

url = "https://pkc.iacr.org/2022/",

}

Aranha, DF, Bennedsen, EM, Campanelli, M, Ganesh, C, Orlandi, C & Takahashi, A 2022, ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. in G Hanaoka, J Shikata & Y Watanabe (eds), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I. vol. 13177, Lecture Notes in Computer Science, vol. 13177, Springer, Cham, pp. 584-614, The 25th International Conference on Practice and Theory of Public-Key Cryptography, 2022, 8/03/22. https://doi.org/10.1007/978-3-030-97121-2_21

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. / Aranha, Diego F.; Bennedsen, Emil Madsen; Campanelli, Matteo et al.

Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I. ed. / Goichiro Hanaoka; Junji Shikata; Yohei Watanabe. Vol. 13177 Springer, Cham, 2022. p. 584-614 (Lecture Notes in Computer Science; Vol. 13177).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines

AU - Aranha, Diego F.

AU - Bennedsen, Emil Madsen

AU - Campanelli, Matteo

AU - Ganesh, Chaya

AU - Orlandi, Claudio

AU - Takahashi, Akira

N1 - Conference code: 25

PY - 2022/2/27

Y1 - 2022/2/27

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

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

U2 - 10.1007/978-3-030-97121-2_21

DO - 10.1007/978-3-030-97121-2_21

M3 - Conference contribution

SN - 978-3-030-97120-5

VL - 13177

T3 - Lecture Notes in Computer Science

SP - 584

EP - 614

BT - Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I

A2 - Hanaoka, Goichiro

A2 - Shikata, Junji

A2 - Watanabe, Yohei

PB - Springer, Cham

T2 - The 25th International Conference on Practice and Theory of Public-Key Cryptography, 2022

Y2 - 8 March 2022 through 11 March 2022

ER -

Aranha DF, Bennedsen EM, Campanelli M, Ganesh C, Orlandi C, Takahashi A. ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. In Hanaoka G, Shikata J, Watanabe Y, editors, Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I. Vol. 13177. Springer, Cham. 2022. p. 584-614. (Lecture Notes in Computer Science). doi: 10.1007/978-3-030-97121-2_21

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this