Proof-carrying data without succinct arguments
From MaRDI portal
Recommendations
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Cluster computing in zero knowledge
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the memory-tightness of hashed ElGamal
- On the size of pairing-based non-interactive arguments
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- Scalable zero knowledge via cycles of elliptic curves
Cited in
(33)- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- On succinct non-interactive arguments in relativized worlds
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Proof-carrying data from arithmetized random oracles
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- Maliciously secure massively parallel computation for all-but-one corruptions
- Nova: recursive zero-knowledge arguments from folding schemes
- Revisiting cycles of pairing-friendly elliptic curves
- Algebraic reductions of knowledge
- Protostar: generic efficient accumulation/folding for special-sound protocols
- Folding schemes with selective verification
- An efficient ZK compiler from SIMD circuits to general circuits
- Mangrove: a scalable framework for folding-based SNARKs
- HyperNova: recursive arguments for customizable constraint systems
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- BOIL: proof-carrying data from accumulation of correlated holographic IOPs
- Incrementally verifiable computation for NP from standard assumptions
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Security bounds for proof-carrying data from straightline extractors
- Updatable privacy-preserving blueprints
- FLI: folding lookup instances
- Proofs for deep thought: accumulation for large memories and deterministic computations
- MuxProofs: succinct arguments for machine computation from vector lookups
- Lova: lattice-based folding scheme from unstructured lattices
- \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems
- IVC in the open-and-sign random oracle model
- Linear-time accumulation schemes
- Cyclo: lightweight lattice-based folding via partial range checks
- How to prove post-quantum security for succinct non-interactive reductions
- Folding schemes with privacy preserving selective verification
- Beyond the circuit -- how to minimize foreign arithmetic in ZKP circuits
This page was built for publication: Proof-carrying data without succinct arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120099)
