Orion: zero knowledge proof with linear prover time
From MaRDI portal
Publication:6166953
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
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Aurora: transparent succinct arguments for R1CS
- Computationally Sound Proofs
- Expander graphs and their applications
- Hardness of bipartite expansion
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time encodable and decodable error-correcting codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On testable properties in bounded degree graphs
- On testing expansion in bounded-degree graphs
- Randomness conductors and constant-degree lossless expanders
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge with no trusted setup
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Testing the expansion of a graph
- The Knowledge Complexity of Interactive Proof Systems
- Transparent SNARKs from DARK compilers
- Updatable and universal common reference strings with applications to zk-SNARKs
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
Cited in
(31)- Libra: succinct zero-knowledge proofs with optimal prover computation
- Transparent SNARKs over Galois rings
- From one-time to two-round reusable multi-signatures without nested forking
- Interactive line-point zero-knowledge with sublinear communication and linear computation
- MuxProofs: succinct arguments for machine computation from vector lookups
- 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
- Natively compatible super-efficient lookup arguments and how to apply them
- Local proofs approaching the witness length
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Spartan and bulletproofs are simulation-extractable (for free!)
- Faster proofs and VRFs from isogenies
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- A crack in the firmament: restoring soundness of the Orion proof system and more
- BrakingBase -- a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- \textsf{FREPack}: improved SNARK frontend for highly repetitive computations
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Linear prover IOPs in log star rounds
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Efficient isogeny proofs using generic techniques
- More efficient isogeny proofs of knowledge via canonical modular polynomials
- Unlocking the lookup singularity with \textsf{Lasso}
- Blaze: fast SNARKs from interleaved RAA codes
- 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
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)
