On the Cryptographic Hardness of Finding a Nash Equilibrium

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=oEmcKBLu8pg


Duration: 23:27
462 views
1

Omer Paneth, Boston University
Securing Computation
http://simons.berkeley.edu/talks/omer-paneth-2015-06-12



Other Videos By Simons Institute for the Theory of Computing


2015-07-15Historical Talk on Lattice-Based Cryptography
2015-07-15Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling
2015-07-15Time-Lock Puzzles from Randomized Encodings
2015-07-15Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling
2015-07-14Pairings in Cryptography
2015-07-06The Oracle's Secrets
2015-06-23Quantum and Post-Quantum Cryptography
2015-06-15Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
2015-06-15Provably Secure Virus Detection: Using the Uncertainty to End Computer Malware
2015-06-15Oblivious RAM for MPC
2015-06-15On the Cryptographic Hardness of Finding a Nash Equilibrium
2015-06-15How Fair is your Protocol? A Utility-Based Approach to Protocol Optimality
2015-06-15New Advances in Secure RAM Computation
2015-06-15Efficient Multiparty Protocols via Log-Depth Threshold Formulae
2015-06-15Two Round MPC via Multi-Key FHE
2015-06-15How to use Bitcoin to Enhance Secure Computation
2015-06-15Obfuscation with Constant Multiplicative Size Overhead
2015-06-15Upending Stock Market Structure Using Secure Computation
2015-06-15Lower Bounds for Information-Theoretic MPC
2015-06-15Obfuscation of Probabilistic Circuits and Applications
2015-06-15Fast Garbling of Circuits Under Standard Assumptions


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Omer Paneth