Pages that link to "Item:Q2829231"

The following pages link to Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231):

Displaying 29 items.

• Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
• FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
• Combiners for functional encryption, unconditionally (Q2055605) (← links)
• Continuous verifiable delay functions (Q2055650) (← links)
• Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
• Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
• Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
• From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
• From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
• From FE combiners to secure MPC and back (Q2175912) (← links)
• Unique end of potential line (Q2194856) (← links)
• Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
• Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Q3181035) (← links)
• The Journey from NP to TFNP Hardness (Q4638115) (← links)
• Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
• Unique End of Potential Line (Q5091211) (← links)
• Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
• Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
• TFNP: An Update (Q5283350) (← links)
• Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
• From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
• The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
• On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
• Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)