Gemini: elastic SNARKs for diverse environments
From MaRDI portal
Publication:2170056
DOI10.1007/978-3-031-07085-3_15zbMath1497.68208OpenAlexW4285234987MaRDI QIDQ2170056
Alessandro Chiesa, Michele Orrù, Yuncong Hu, Jonathan Bootle
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_15
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Related Items (1)
Uses Software
Cites Work
- Checking the correctness of memories
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Linear-time arguments with sublinear verification from tensor codes
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Time- and space-efficient arguments from groups of unknown order
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Aurora: transparent succinct arguments for R1CS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Practical verified computation with streaming interactive proofs
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Constant-Size Commitments to Polynomials and Their Applications
- Interactive Oracle Proofs
- Randomizable Proofs and Delegatable Anonymous Credentials
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the Evaluation of Powers and Monomials
- Algebraic methods for interactive proof systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Constant-round interactive proofs for delegating computation
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Advances in Cryptology - ASIACRYPT 2003
- Proofs for inner pairing products and applications
This page was built for publication: Gemini: elastic SNARKs for diverse environments
