On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
From MaRDI portal
Publication:6061369
DOI10.1007/978-3-031-30617-4_15OpenAlexW4365807462MaRDI QIDQ6061369
Jesper Buus Nielsen, Mathias Hall-Andersen
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_15
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Cites Work
- Unnamed Item
- Definitions and properties of zero-knowledge proof systems
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Recursive proof composition from accumulation schemes
- Proof-carrying data without succinct arguments
- Subquadratic SNARGs in the random oracle model
- Non-interactive batch arguments for NP from standard assumptions
- On succinct non-interactive arguments in relativized worlds
- Tight security bounds for Micali's SNARGs
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Interactive Oracle Proofs
- Random Oracles and Auxiliary Input
- How to delegate computations publicly
- 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
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- Lower bound on SNARGs in the random oracle model
This page was built for publication: On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
