PPAD is as hard as LWE and iterated squaring
From MaRDI portal
(Redirected from Publication:6169422)
Recommendations
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Can PPAD hardness be based on standard cryptographic assumptions?
- Can PPAD hardness be based on standard cryptographic assumptions?
- The complexity of computing a Nash equilibrium
- Delegation with updatable unambiguous proofs and PPAD-hardness
Cites work
- A decade of lattice cryptography
- Algebraic methods for interactive proof systems
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Computational Complexity
- Constant-round interactive proofs for delegating computation
- Continuous verifiable delay functions
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Fiat-Shamir: from practice to theory
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- From obfuscation to the security of Fiat-Shamir for proofs
- Functional encryption: definitions and challenges
- Generating random factored numbers, easily
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- How to Generate Factored Random Numbers
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 6783433 (Why is no real title available?)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-cooperative games
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive zero knowledge from sub-exponential DDH
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- On the complexity of the parity argument and other inefficient proofs of existence
- On total functions, existence theorems and computational complexity
- Parallelizable delegation from LWE
- Practical statistically-sound proofs of exponentiation in any group
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Settling the complexity of computing two-player Nash equilibria
- Simple verifiable delay functions
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for P from sub-exponential DDH and QR
- Stronger security proofs for RSA and Rabin bits.
- The complexity of computing a Nash equilibrium
- The Group of Signed Quadratic Residues and Applications
- Time- and space-efficient arguments from groups of unknown order
- Unique End of Potential Line
- Verifiable delay functions
Cited in
(14)- Delegation with updatable unambiguous proofs and PPAD-hardness
- Can PPAD hardness be based on standard cryptographic assumptions?
- Can PPAD hardness be based on standard cryptographic assumptions?
- Certifying giant nonprimes
- Non-interactive universal arguments
- Lattice-based timed cryptography
- (Verifiable) delay functions from Lucas sequences
- Breaking verifiable delay functions in the random oracle model
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- One-way functions vs. TFNP: Simpler and improved
- Smooth Nash equilibria: algorithms and complexity
- Homomorphic secret sharing with verifiable evaluation
- Impossibility of VDFs in the ROM: the complete picture
- Separating verifiable delay functions and time-lock puzzles
This page was built for publication: PPAD is as hard as LWE and iterated squaring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169422)
