Rational Protocol Design: Cryptography against Incentive-Driven Adversaries

• Published in: Annual Symposium on Foundations of Computer Science pp. 648 - 657
• Main Authors: Garay, Juan, Katz, Jonathan, Maurer, Ueli, Tackmann, Bjorn, Zikas, Vassilis
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.10.2013
• Subjects: Composition; Cryptography; Game theory; Games; Privacy; Protocols; Secure Computation
• ISSN: 0272-5428
• DOI: 10.1109/FOCS.2013.75

Existing work on "rational cryptographic protocols" treats each party (or coalition of parties) running the protocol as a selfish agent trying to maximize its utility. In this work we propose a fundamentally different approach that is better suited to modeling a protocol under attack from an external entity. Specifically, we consider a two-party game between an protocol designer and an external attacker. The goal of the attacker is to break security properties such as correctness or privacy, possibly by corrupting protocol participants; the goal of the protocol designer is to prevent the attacker from succeeding. We lay the theoretical groundwork for a study of cryptographic protocol design in this setting by providing a methodology for defining the problem within the traditional simulation paradigm. Our framework provides ways of reasoning about important cryptographic concepts (e.g., adaptive corruptions or attacks on communication resources) not handled by previous game-theoretic treatments of cryptography. We also prove composition theorems that-for the first time-provide a sound way to design rational protocols assuming "ideal communication resources" (such as broadcast or authenticated channels) and then instantiate these resources using standard cryptographic tools. Finally, we investigate the problem of secure function evaluation in our framework, where the attacker has to pay for each party it corrupts. Our results demonstrate how knowledge of the attacker's incentives can be used to circumvent known impossibility results in this setting.