Incrementally verifiable computation via rate-1 batch arguments
From MaRDI portal
Cited in
(16)- Incrementally verifiable computation for NP from standard assumptions
- Rate-1 statistical non-interactive zero-knowledge
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Security bounds for proof-carrying data from straightline extractors
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Batching adaptively-sound SNARGs for NP
- Pairing-based batch arguments for NP with a linear-size CRS
- Pairing-based aggregate signatures without random oracles
- IVC in the open-and-sign random oracle model
- Relativized succinct arguments in the ROM do not exist
- Boosting SNARKs and rate-1 barrier in arguments of knowledge
- On composing AGM-secure functionalities with cryptographic proofs. Applications to unbounded-depth IVC and more
- On the simulation-extractability of proof-carrying data
- Multi-hop multi-key homomorphic signatures with context hiding from standard assumptions
This page was built for publication: Incrementally verifiable computation via rate-1 batch arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942986)
