SNARGs for monotone policy batch NP
From MaRDI portal
Publication:6145787
DOI10.1007/978-3-031-38545-2_9MaRDI QIDQ6145787
Maya Farber Brodsky, Yael Tauman Kalai, Omer Paneth, Zvika Brakerski, Alex Lombardi
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Non-interactive batch arguments for NP from standard assumptions
- Somewhere statistical soundness, post-quantum security, and SNARGs
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Delegating RAM Computations
- Probabilistically Checkable Arguments
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- How to delegate computations publicly
- Succinct delegation for low-space non-deterministic computation
- How to use indistinguishability obfuscation
- How to delegate computations
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Witness encryption and its applications
- 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: SNARGs for monotone policy batch NP
