SNARGs for P from sub-exponential DDH and QR
From MaRDI portal
Publication:2170061
DOI10.1007/978-3-031-07085-3_18zbMath1497.68213OpenAlexW4285136272MaRDI QIDQ2170061
Akshayaram Srinivasan, Ruta Jawale, Dakshita Khurana, James Hulett
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_18
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Communication complexity, information complexity (68Q11)
Related Items (6)
SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ PPAD is as hard as LWE and iterated squaring ⋮ 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
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- The hunting of the SNARK
- Statistical ZAPR arguments from bilinear maps
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Witness indistinguishability for any single-round argument with applications to access control
- Non-interactive zero knowledge from sub-exponential DDH
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive batch arguments for NP from standard assumptions
- On the (In)security of Kilian-based SNARGs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- Security Proofs for Signature Schemes
- Secure Two-Party Computation with Low Communication
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- The random oracle methodology, revisited
- Delegating Computation
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Delegating RAM Computations
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- How to delegate computations publicly
- Multi-collision resistance: a paradigm for keyless hash functions
- Succinct delegation for low-space non-deterministic computation
- How to delegate computations
- Constant-round interactive proofs for delegating computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Delegation for bounded space
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
This page was built for publication: SNARGs for P from sub-exponential DDH and QR
