\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
From MaRDI portal
Publication:2055643
DOI10.1007/978-3-030-45721-1_27OpenAlexW3023964980MaRDI QIDQ2055643FDOQ2055643
Authors: Alessandro Chiesa, Dev Ojha, Nicholas Spooner 
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)
Cites Work
- A taxonomy 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
- The random oracle methodology, revisited.
- Non-interactive proofs of proximity
- Algebraic methods for interactive proof systems
- Short pairing-based non-interactive zero-knowledge arguments
- Computationally Sound Proofs
- Random oracles in a quantum world
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- On Cycles of Pairing-Friendly Elliptic Curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Delegating computation: interactive proofs for muggles
- Constant-round interactive proofs for delegating computation
- Updatable and universal common reference strings with applications to zk-SNARKs
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Fast approximate probabilistically checkable proofs
- On the size of pairing-based non-interactive arguments
- Interactive proofs of proximity: delegating computation in sublinear time
- Interactive oracle proofs
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Scalable zero knowledge via cycles of elliptic curves
- Cluster computing in zero knowledge
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- \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
- Fast Reed-Solomon interactive oracle proofs of proximity
- Title not available (Why is that?)
Cited In (56)
- A simple and efficient framework of proof systems for NP
- Fiat-Shamir security of FRI and related SNARKs
- Generic security of the SAFE API and its applications
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Sigma protocols from verifiable secret sharing and their applications
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An algebraic framework for universal and updatable SNARKs
- Proof-carrying data without succinct arguments
- Time- and space-efficient arguments from groups of unknown order
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Zero knowledge proofs towards verifiable decentralized AI pipelines
- GUC-secure commitments via random oracles: new impossibility and feasibility
- Title not available (Why is that?)
- Proofs for inner pairing products and applications
- Proof-carrying data from arithmetized random oracles
- Witness-succinct universally-composable SNARKs
- Ligero: lightweight sublinear arguments without a trusted setup
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Nova: recursive zero-knowledge arguments from folding schemes
- Orion: zero knowledge proof with linear prover time
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Sumcheck arguments and their applications
- Succinct vector, polynomial, and functional commitments from lattices
- On interactive oracle proofs for Boolean R1CS statements
- Non-interactive zero-knowledge from non-interactive batch arguments
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Gemini: elastic SNARKs for diverse environments
- On succinct non-interactive arguments in relativized worlds
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Transparent SNARKs from DARK compilers
- Efficient KZG-based univariate sum-check and lookup argument
- Concurrently secure blind Schnorr signatures
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Inner product functional commitments with constant-size public parameters and openings
- Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures
- A PCP theorem for interactive proofs and applications
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- NIZK from SNARGs
- Lower bound on SNARGs in the random oracle model
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- FRIDA: data availability sampling from FRI
- Sometimes you can't distribute random-oracle-based proofs
- On soundness notions for interactive oracle proofs
- How to prove statements obliviously?
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- On the concrete security of non-interactive FRI
This page was built for publication: \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055643)
