Orion: zero knowledge proof with linear prover time
From MaRDI portal
Publication:6166953
DOI10.1007/978-3-031-15985-5_11zbMath1518.94099OpenAlexW4313042292MaRDI QIDQ6166953
Yu-Peng Zhang, Dawn Song, Tiancheng Xie
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
Related Items (7)
HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Succinct arguments for RAM programs via projection codes ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Testing the expansion of a graph
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- 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
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- On Testing Expansion in Bounded-Degree Graphs
- Linear-time encodable and decodable error-correcting codes
- Expander graphs and their applications
- Randomness conductors and constant-degree lossless expanders
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Computationally Sound Proofs
- Hardness of Bipartite Expansion.
This page was built for publication: Orion: zero knowledge proof with linear prover time
