SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption

Related Items (max. 100)

Correlation intractability and SNARGs from sub-exponential DDH ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A simplified NP-complete satisfiability problem
NP is as easy as detecting unique solutions
On the complexity of the parity argument and other inefficient proofs of existence
Fiat-Shamir and correlation intractability from strong KDM-secure encryption
From obfuscation to the security of Fiat-Shamir for proofs
Uniform constant-depth threshold circuits for division and iterated multiplication.
Continuous verifiable delay functions
Non-interactive zero knowledge from sub-exponential DDH
Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
Delegation with updatable unambiguous proofs and PPAD-hardness
NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
Non-interactive batch arguments for NP from standard assumptions
SNARGs for P from sub-exponential DDH and QR
On the (In)security of Kilian-based SNARGs
Noninteractive zero knowledge for NP from (Plain) Learning With Errors
Somewhere statistical soundness, post-quantum security, and SNARGs
Fully-succinct publicly verifiable delegation from constant-size assumptions
On the Correlation Intractability of Obfuscated Pseudorandom Functions
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
IP = PSPACE Using Error-Correcting Codes
Settling the complexity of computing two-player Nash equilibria
Lossy trapdoor functions and their applications
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Probabilistic Algorithms in Finite Fields
A New Algorithm for Factoring Polynomials Over Finite Fields
Algebraic methods for interactive proof systems
On Doubly-Efficient Interactive Proof Systems
The Complexity of Computing a Nash Equilibrium
Fiat-Shamir: from practice to theory
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
How to delegate computations publicly
Constant-round interactive proofs for delegating computation
Separating succinct non-interactive arguments from all falsifiable assumptions
Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
Factoring Polynomials Over Large Finite Fields
Indistinguishability obfuscation from well-founded assumptions
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)
Batch arguments for \textsf{NP} and more from standard bilinear group assumptions

This page was built for publication: SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption