Closing Keynote Day 2
summary
Argues that mediator-based protocols can be compiled into fully decentralized protocols using cryptography and MPC, specifically employing verifiable secret sharing and multi-party computation plus cheap talk. Gives sharp thresholds: deterministic bounded compilation requires n > 3k + t; randomized implementation with punishment needs 2k + 3t < n (finite expected time); broadcast and cryptographic variants lower the bounds further. Provides explicit constructions, matching lower bounds, and points out previous buggy bounded algorithms in the literature.
AI-written summary · about
chapters (12)
- 0:00Distributed computing and game theory
- 3:05Byzantine agreement in systems
- 10:31Mediators and decentralization
- 12:25Nash equilibrium and resilience
- 20:29Mediators without trusted parties
- 27:06Mediator implementation concept
- 31:52Punishment strategies for players
- 38:28Protocol running time bounds
- 43:54Asynchronous fault tolerance
- 47:54Message to economists on equilibrium
- 53:14Proof using secret sharing
- 1:01:17Q&A
related talks
01h 08mSecure Computation 1
29mTowards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
58mSecure Multiparty Computation I
40mApplied MPC
01h 02mConditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds
30mOn the Optimal Round Complexity of Multi-Party Computation in the Plain Model
20mWhat Can Cryptography Do For Decentralized Mechanism Design?
01h 06mDelegating Computation II