ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines

DOI10.1007/978-3-030-97121-2_21zbMath1499.68112OpenAlexW3197025878MaRDI QIDQ5087274

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

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (2)

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates

Uses Software

• Pinocchio
• SNARKs for C
• ZKBoo
• Geppetto
• Marlin
• LegoSNARK
• DIZK
• Spartan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-interactive zero-knowledge proofs for composite statements
• Updatable and universal common reference strings with applications to zk-SNARKs
• Balancing privacy and accountability in blockchain identity management
• The algebraic group model and its applications
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• A compressed \(\varSigma \)-protocol theory for lattices
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
• Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Constant-Size Commitments to Polynomials and Their Applications
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The knowledge complexity of interactive proof-systems
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
• On the Size of Pairing-Based Non-interactive Arguments
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines