Boosting batch arguments and RAM delegation
From MaRDI portal
Publication:6499320
DOI10.1145/3564246.3585200MaRDI QIDQ6499320
Daniel Wichs, Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan
Publication date: 8 May 2024
Related Items (13)
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
Cites Work
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Trapdoor hash functions and their applications
- Somewhere statistical soundness, post-quantum security, and SNARGs
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Delegating RAM Computations
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- How to delegate computations publicly
- How to delegate computations
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Delegation for bounded space
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
This page was built for publication: Boosting batch arguments and RAM delegation
