Towards a Game Theoretic View of Secure Computation [chapter]

Gilad Asharov, Ran Canetti, Carmit Hazay
2011 Lecture Notes in Computer Science  
We 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, we 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, we concentrate on fairness. Here we demonstrate a Game Theoretic notion and two different cryptographic notions
more » ... hat turn out to all be equivalent. In addition, we provide a simulation-based notion that implies the previous three. All four notions are weaker than existing cryptographic notions of fairness. In particular, we show that they can be met in some natural setting where existing notions of fairness are provably impossible to achieve.
doi:10.1007/978-3-642-20465-4_24 fatcat:wrloku7wbng4bcnjjnobvguilq