Somewhere statistical soundness, post-quantum security, and SNARGs
From MaRDI portal
Publication:2695640
DOI10.1007/978-3-030-90459-3_12OpenAlexW3212906231MaRDI QIDQ2695640
Yael Tauman Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_12
Related Items (8)
SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ SNARGs for monotone policy batch NP ⋮ Verifiable private information retrieval ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- On the (In)security of Kilian-based SNARGs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Trapdoor hash functions and their applications
- Cryptographic Assumptions: A Position Paper
- Spooky Encryption and Its Applications
- Quantum Proofs of Knowledge
- Zero-knowledge against quantum attacks
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- 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 delegate computations
- Information Security
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Delegation for bounded space
- Automata, Languages and Programming
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
This page was built for publication: Somewhere statistical soundness, post-quantum security, and SNARGs
