Explore a 25-minute conference talk from Crypto 2016 that delves into the cryptographic challenges of finding a Nash Equilibrium. Learn from experts Sanjam Garg, Omkant Pandey, and Akshayaram Srinivasan as they present their research on this complex topic in game theory and cryptography. Gain insights into the intersection of these fields and understand the implications for computational complexity and security.
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Overview
Syllabus
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Taught by
TheIACR
Related Courses
-
Smoothed Complexity of 2-player Nash Equilibria
-
Permuted Puzzles and Cryptographic Hardness
-
Communication Complexity of Nash Equilibrium in Potential Games
-
Towards Practical Whitebox Cryptography - Optimizing Efficiency and Space Hardness
-
Is it Easier to Prove Statements that are Guaranteed to be True?
-
On the Impossibility of Tight Cryptographic Reductions
