Model-generic incrementally verifiable computation from updatable BARGs
From MaRDI portal
Cites work
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Boosting batch arguments and RAM delegation
- Computationally Sound Proofs
- Correlation intractability and SNARGs from sub-exponential DDH
- Delegating RAM Computations
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- How to delegate computations publicly
- How to use indistinguishability obfuscation
- Incrementally verifiable computation for NP from standard assumptions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Incrementally verifiable computation via rate-1 batch arguments
- Locally verifiable distributed SNARGs
- Non-interactive batch arguments for NP from standard assumptions
- Proof labeling schemes
- Rate-1 non-interactive arguments for batch-NP and applications
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Scalable zero knowledge via cycles of elliptic curves
- SNARGs for \(\mathcal{P}\) from LWE
This page was built for publication: Model-generic incrementally verifiable computation from updatable BARGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445511)