Proof-carrying data without succinct arguments
From MaRDI portal
Publication:2120099
DOI10.1007/978-3-030-84242-0_24zbMath1485.94066OpenAlexW3127664165MaRDI QIDQ2120099
William Lin, Nicholas Spooner, Benedikt Bünz, Pratyush Mishra, Alessandro Chiesa
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_24
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
On succinct non-interactive arguments in relativized worlds ⋮ 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 ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions
Uses Software
Cites Work
- Scalable zero knowledge via cycles of elliptic curves
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- On the memory-tightness of hashed ElGamal
- Recursive proof composition from accumulation schemes
- Cluster Computing in Zero Knowledge
- 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
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
