Proof-carrying data from arithmetized random oracles
From MaRDI portal
Publication:6061366
DOI10.1007/978-3-031-30617-4_13MaRDI QIDQ6061366
Jack O'Connor, Alessandro Chiesa, Nicholas Spooner, Tom Gur, Megan Chen
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- The black-box query complexity of polynomial summation
- Zero knowledge protocols from succinct constraint detection
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Recursive proof composition from accumulation schemes
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Proof-carrying data without succinct arguments
- On succinct non-interactive arguments in relativized worlds
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Algebrization
- Cluster Computing in Zero Knowledge
- Interactive PCP
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Combinatorial Nullstellensatz
- Computationally Sound Proofs
- Verifiable Delegation of Computation over Large Datasets
- 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
- On the Size of Pairing-Based Non-interactive Arguments
- Augmented random oracles
- Nova: recursive zero-knowledge arguments from folding schemes
This page was built for publication: Proof-carrying data from arithmetized random oracles
