Somewhere statistical soundness, post-quantum security, and SNARGs
From MaRDI portal
Publication:2695640
DOI10.1007/978-3-030-90459-3_12OpenAlexW3212906231MaRDI QIDQ2695640FDOQ2695640
Authors: 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
Recommendations
Cites Work
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Title not available (Why is that?)
- How to delegate computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Information Security
- How to delegate computations publicly
- Succinct delegation for low-space non-deterministic computation
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Quantum proofs of knowledge
- Automata, Languages and Programming
- Cryptographic assumptions: a position paper
- Spooky Encryption and Its Applications
- On the communication complexity of secure function evaluation with long output
- 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
- Delegation for bounded space
- Trapdoor hash functions and their applications
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- On the (In)security of Kilian-based SNARGs
- 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)
Cited In (18)
- On the (In)security of Kilian-based SNARGs
- SNARGs for monotone policy batch NP
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Lattice-based functional commitments: fast verification and cryptanalysis
- New realizations of somewhere statistically binding hashing and positional accumulators
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Non-interactive zero-knowledge from non-interactive batch arguments
- Non-interactive publicly-verifiable delegation of committed programs
- Correlation intractability and SNARGs from sub-exponential DDH
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- Rate-1 fully local somewhere extractable hashing from DDH
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Probabilistically checkable arguments for all NP
- Strong batching for non-interactive statistical zero-knowledge
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Boosting batch arguments and RAM delegation
- Verifiable private information retrieval
This page was built for publication: Somewhere statistical soundness, post-quantum security, and SNARGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695640)
