Orion: zero knowledge proof with linear prover time
From MaRDI portal
Publication:6166953
DOI10.1007/978-3-031-15985-5_11zbMATH Open1518.94099OpenAlexW4313042292MaRDI QIDQ6166953FDOQ6166953
Authors: Tiancheng Xie, Yupeng Zhang, Dawn Song 
Publication date: 7 July 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15985-5_11
Recommendations
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
Cites Work
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Expander graphs and their applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Linear-time encodable and decodable error-correcting codes
- The Knowledge Complexity of Interactive Proof Systems
- Randomness conductors and constant-degree lossless expanders
- Title not available (Why is that?)
- Computationally Sound Proofs
- Testing the expansion of a graph
- Title not available (Why is that?)
- On testable properties in bounded degree graphs
- On testing expansion in bounded-degree graphs
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Updatable and universal common reference strings with applications to zk-SNARKs
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Scalable zero knowledge via cycles of elliptic curves
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Transparent SNARKs from DARK compilers
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Hardness of bipartite expansion
- Linear-time arguments with sublinear verification from tensor codes
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
Cited In (16)
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Succinct arguments for RAM programs via projection codes
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Spartan and bulletproofs are simulation-extractable (for free!)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Efficient isogeny proofs using generic techniques
- Unlocking the lookup singularity with \textsf{Lasso}
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Field-agnostic SNARKs from expand-accumulate codes
- How to prove statements obliviously?
- Zero-knowledge IOPs approaching witness length
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Libra: succinct zero-knowledge proofs with optimal prover computation
This page was built for publication: Orion: zero knowledge proof with linear prover time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166953)
