Incrementally verifiable computation via incremental PCPs
From MaRDI portal
Publication:2175954
DOI10.1007/978-3-030-36033-7_21zbMath1452.68079OpenAlexW2990096638MaRDI QIDQ2175954
Moni Naor, Omer Paneth, Guy N. Rothblum
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_21
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- On the complexity of interactive proofs with bounded communication
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- The hunting of the SNARK
- Spooky Encryption and Its Applications
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fully homomorphic encryption using ideal lattices
- How to delegate computations publicly
- How to delegate computations
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Delegation for bounded space
This page was built for publication: Incrementally verifiable computation via incremental PCPs
