Delegation with updatable unambiguous proofs and PPAD-hardness
From MaRDI portal
Publication:2104236
DOI10.1007/978-3-030-56877-1_23zbMATH Open1504.94153OpenAlexW3048764796MaRDI QIDQ2104236FDOQ2104236
Authors: Yael Tauman Kalai, Omer Paneth, Lisa Yang 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_23
Recommendations
Cites Work
- The complexity of computing a Nash equilibrium
- On the complexity of the parity argument and other inefficient proofs of existence
- Settling the complexity of computing two-player Nash equilibria
- How to delegate computations
- How to use indistinguishability obfuscation
- Algebraic methods for interactive proof systems
- Magic functions
- How to delegate computations publicly
- Constant-round interactive proofs for delegating computation
- Simple verifiable delay functions
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Spooky Encryption and Its Applications
- From Minicrypt to Obfustopia via private-key functional encryption
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Delegation for bounded space
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
- Title not available (Why is that?)
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- Witness Maps and Applications
Cited In (7)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Non-interactive universal arguments
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- PPAD is as hard as LWE and iterated squaring
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
- Monotone-policy aggregate signatures
This page was built for publication: Delegation with updatable unambiguous proofs and PPAD-hardness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104236)
