Boosting batch arguments and RAM delegation
From MaRDI portal
Cites work
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Delegating RAM Computations
- Delegation for bounded space
- Fiat-Shamir: from practice to theory
- How to delegate computations
- How to delegate computations publicly
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- On the communication complexity of secure function evaluation with long output
- Separating succinct non-interactive arguments from all falsifiable assumptions
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for P from sub-exponential DDH and QR
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Trapdoor hash functions and their applications
Cited in
(35)- A simple and efficient framework of proof systems for NP
- Locally verifiable distributed SNARGs
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Lattice-based functional commitments: fast verification and cryptanalysis
- Rate-1 fully local somewhere extractable hashing from DDH
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Monotone-policy aggregate signatures
- Strong batching for non-interactive statistical zero-knowledge
- Reducing the CRS size in registered ABE systems
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Non-interactive zero-knowledge from LPN and MQ
- Adaptively sound zero-knowledge SNARKs for UP
- Rate-1 statistical non-interactive zero-knowledge
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Malicious security for PIR (almost) for free
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- Functional commitments and SNARGs for P/poly from SIS
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Chosen ciphertext security via BARGs
- Monotone-policy BARGs and more from BARGs and quadratic residuosity
- Batch arguments to NIZKs from one-way functions
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Batching adaptively-sound SNARGs for NP
- Key-homomorphic and aggregate verifiable random functions
- 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
- On succinct non-interactive secure computation with malicious security
- Silent threshold cryptography from pairings: expressive policies in the plain model
- Boosting SNARKs and rate-1 barrier in arguments of knowledge
- Pairing-based functional commitments for circuits with shorter parameters
- Attribute-based signatures for circuits with optimal parameter size from standard assumptions
- Multi-hop multi-key homomorphic signatures with context hiding from standard assumptions
This page was built for publication: Boosting batch arguments and RAM delegation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499320)
