Brakedown: linear-time and field-agnostic SNARKs for R1CS
From MaRDI portal
Publication:6145784
DOI10.1007/978-3-031-38545-2_7MaRDI QIDQ6145784
No author found.
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- How to construct constant-round zero-knowledge proof systems for NP
- 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
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Practical verified computation with streaming interactive proofs
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Faster Batch Forgery Identification
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Constant-Size Commitments to Polynomials and Their Applications
- Linear-time encodable and decodable error-correcting codes
- Interactive Oracle Proofs
- Decaf: Eliminating Cofactors Through Point Compression
- Efficient CM-constructions of elliptic curves over finite fields
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Algebraic methods for interactive proof systems
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Constant-round interactive proofs for delegating computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the Size of Pairing-Based Non-interactive Arguments
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Ligero: lightweight sublinear arguments without a trusted setup
- Proving as fast as computing: succinct arguments with constant prover overhead
- Orion: zero knowledge proof with linear prover time
- Nova: recursive zero-knowledge arguments from folding schemes
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
