Fair Computation with Rational Players

Explore a talk from Eurocrypt 2012 on fair computation with rational players, presented by Adam Groce and Jonathan Katz. Delve into the intersection of game theory and cryptography, examining two-party computation and strategies for dealing with impossibility results. Learn about the authors' high-level findings and their context within recent research. Investigate the real-world and ideal-world game scenarios, including goals, utilities, and honest strategies. Analyze the proposed protocol and its potential for early abortion. Conclude by considering extensions and open problems in this field of study.

Intro
Two-party computation
Dealing with this impossibility
Our results (high level)
Putting our result in context Much recent interest in combining game theory and cryptography
The real-world game
Goal
Asharov-Canetti-Hazay (2011)
The ideal-world game
Utilities
Honest strategy of P, (ideal world)
Our protocol 1
Analysis - Will P, abort early?
Conclusion
Extensions and open problems