Towards a Game Theoretic View of Secure Computation
The authors demonstrate how Game Theoretic concepts and formalism can be used to capture cryptographic notions of security. In the restricted but indicative case of two-party protocols in the face of malicious fail-stop faults, they first show how the traditional notions of secrecy and correctness of protocols can be captured as properties of Nash equilibria in games for rational players. Next, they concentrate on fairness. Here they demonstrate a Game Theoretic notion and two different cryptographic notions that turn out to all be equivalent. In addition, they provide a simulation based notion that implies the previous three.