On succinct non-interactive arguments in relativized worlds
From MaRDI portal
Publication:2170051
DOI10.1007/978-3-031-07085-3_12zbMath1496.94033OpenAlexW4285128331MaRDI QIDQ2170051
Megan Chen, Nicholas Spooner, Alessandro Chiesa
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_12
Related Items (2)
Proof-carrying data from arithmetized random oracles ⋮ On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
Uses Software
Cites Work
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Zero knowledge protocols from succinct constraint detection
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Recursive proof composition from accumulation schemes
- Proof-carrying data without succinct arguments
- UC-secure CRS generation for SNARKs
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Algebrization
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Interactive PCP
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Verifiable Delegation of Computation over Large Datasets
- Advances in Cryptology - EUROCRYPT 2004
- 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
- Cryptography and Coding
This page was built for publication: On succinct non-interactive arguments in relativized worlds
