\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
DOI10.1007/978-3-030-97121-2_21zbMATH Open1499.68112OpenAlexW3197025878MaRDI QIDQ5087274FDOQ5087274
Authors: Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi 
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_21
Recommendations
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Prover-efficient commit-and-prove zero-knowledge SNARKs
- Prover-efficient commit-and-prove zero-knowledge snarks
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Scalable zero knowledge via cycles of elliptic curves
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Snarks for C: verifying program executions succinctly and in zero knowledge
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The knowledge complexity of interactive proof-systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Short pairing-based non-interactive zero-knowledge arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Non-interactive zero-knowledge proofs for composite statements
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Balancing privacy and accountability in blockchain identity management
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- On the size of pairing-based non-interactive arguments
- Prover-efficient commit-and-prove zero-knowledge SNARKs
- Scalable zero knowledge via cycles of elliptic curves
- Constant-Size Commitments to Polynomials and Their Applications
- Transparent SNARKs from DARK compilers
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
- A compressed \(\varSigma \)-protocol theory for lattices
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Cited In (9)
- Sigma protocols from verifiable secret sharing and their applications
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Prover-efficient commit-and-prove zero-knowledge snarks
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Prover-efficient commit-and-prove zero-knowledge SNARKs
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
Uses Software
This page was built for publication: \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087274)
