Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
From MaRDI portal
Publication:2163394
DOI10.1016/j.tcs.2022.06.005OpenAlexW4282974102WikidataQ113863147 ScholiaQ113863147MaRDI QIDQ2163394
Liguan Wang, Shuangjun Zhang, Haibin Kan
Publication date: 10 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.005
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-deterministic exponential time has two-prover interactive protocols
- 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-size constant-query IOPs for delegating computation
- Aurora: transparent succinct arguments for R1CS
- Improved low-degree testing and its applications
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Proof verification and the hardness of approximation problems
- Interactive Oracle Proofs
- Short PCPs with Polylog Query Complexity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Probabilistic checking of proofs
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On the Size of Pairing-Based Non-interactive Arguments
This page was built for publication: Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
