\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
From MaRDI portal
Publication:5087274
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
Cites work
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- A compressed \(\varSigma \)-protocol theory for lattices
- Balancing privacy and accountability in blockchain identity management
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Non-interactive zero-knowledge proofs for composite statements
- On the size of pairing-based non-interactive arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Prover-efficient commit-and-prove zero-knowledge SNARKs
- Quadratic span programs and succinct NIZKs without PCPs
- Scalable zero knowledge via cycles of elliptic curves
- Short pairing-based non-interactive zero-knowledge arguments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct non-interactive arguments via linear interactive proofs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- The algebraic group model and its applications
- The knowledge complexity of interactive proof-systems
- Transparent SNARKs from DARK compilers
- Updatable and universal common reference strings with applications to zk-SNARKs
Cited in
(15)- Prover-efficient commit-and-prove zero-knowledge snarks
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Prover-efficient commit-and-prove zero-knowledge SNARKs
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Sigma protocols from verifiable secret sharing and their applications
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of -protocols
- Lightweight transparent zero-knowledge proofs for cross-domain statements
- SNARKs for virtual machines are non-malleable
- Hybrid zero-knowledge from garbled circuits
- Natively compatible super-efficient lookup arguments and how to apply them
- How to make rational arguments practical and extractable
Describes a project that uses
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)
