\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
From MaRDI portal
Publication:2055643
DOI10.1007/978-3-030-45721-1_27OpenAlexW3023964980MaRDI QIDQ2055643
Dev Ojha, Nicholas Spooner, Alessandro Chiesa
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_27
Cryptography (94A60) Theory of computing (68Qxx) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (39)
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Proof-carrying data without succinct arguments ⋮ Sumcheck arguments and their applications ⋮ An algebraic framework for universal and updatable SNARKs ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs ⋮ A PCP theorem for interactive proofs and applications ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ On succinct non-interactive arguments in relativized worlds ⋮ Gemini: elastic SNARKs for diverse environments ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Zero knowledge proofs towards verifiable decentralized AI pipelines ⋮ Witness-succinct universally-composable SNARKs ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Proof-carrying data from arithmetized random oracles ⋮ On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ NIZK from SNARGs ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Proofs for inner pairing products and applications ⋮ Lower bound on SNARGs in the random oracle model ⋮ Orion: zero knowledge proof with linear prover time ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Unnamed Item ⋮ Transparent SNARKs from DARK compilers ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Fast approximate probabilistically checkable proofs
- 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
- Succinct arguments in the quantum random oracle model
- Linear-size constant-query IOPs for delegating computation
- UC-secure CRS generation for SNARKs
- A taxonomy of pairing-friendly elliptic curves
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Cluster Computing in Zero Knowledge
- Non-Interactive Proofs of Proximity
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- The random oracle methodology, revisited
- Random Oracles in a Quantum World
- Delegating Computation
- Interactive Oracle Proofs
- Algebraic methods for interactive proof systems
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Constant-round interactive proofs for delegating computation
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Interactive proofs of proximity
- On the Size of Pairing-Based Non-interactive Arguments
- On Cycles of Pairing-Friendly Elliptic Curves
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
This page was built for publication: \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
