Cryptography and game theory

Yevgeniy Dodis, Tal Rabin

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

The Cryptographic and Game Theory worlds seem to have an intersection in that they both deal with an interaction between mutually distrustful parties which has some end result. In the cryptographic setting the multiparty interaction takes the shape of a set of parties communicating for the purpose of evaluating a function on their inputs, where each party receives at the end some output of the computation. In the game theoretic setting, parties interact in a game that guarantees some payoff for the participants according to the joint actions of all the parties, while the parties wish to maximize their own payoff. In the past few years the relationship between these two areas has been investigated with the hope of having cross fertilization and synergy. In this chapter we describe the two areas, the similarities and differences, and some of the new results stemming from their interaction. The first and second section will describe the cryptographic and the game theory settings (respectively). In the third section we contrast the two settings, and in the last sections we detail some of the existing results. Cryptographic Notions and Settings Cryptography is a vast subject requiring its own book. Therefore, in the following we will give only a high-level overview of the problem of Multi-Party Computation (MPC), ignoring most of the lower-level details and concentrating only on aspects relevant to Game Theory.

Original languageEnglish (US)
Title of host publicationAlgorithmic Game Theory
PublisherCambridge University Press
Pages181-206
Number of pages26
ISBN (Print)9780511800481, 9780521872829
DOIs
StatePublished - Jan 1 2007

Fingerprint

Game theory
Cryptography

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Dodis, Y., & Rabin, T. (2007). Cryptography and game theory. In Algorithmic Game Theory (pp. 181-206). Cambridge University Press. https://doi.org/10.1017/CBO9780511800481.010

Cryptography and game theory. / Dodis, Yevgeniy; Rabin, Tal.

Algorithmic Game Theory. Cambridge University Press, 2007. p. 181-206.

Research output: Chapter in Book/Report/Conference proceedingChapter

Dodis, Y & Rabin, T 2007, Cryptography and game theory. in Algorithmic Game Theory. Cambridge University Press, pp. 181-206. https://doi.org/10.1017/CBO9780511800481.010
Dodis Y, Rabin T. Cryptography and game theory. In Algorithmic Game Theory. Cambridge University Press. 2007. p. 181-206 https://doi.org/10.1017/CBO9780511800481.010
Dodis, Yevgeniy ; Rabin, Tal. / Cryptography and game theory. Algorithmic Game Theory. Cambridge University Press, 2007. pp. 181-206
@inbook{063d1c15f89140ff8383067cc5bd9077,
title = "Cryptography and game theory",
abstract = "The Cryptographic and Game Theory worlds seem to have an intersection in that they both deal with an interaction between mutually distrustful parties which has some end result. In the cryptographic setting the multiparty interaction takes the shape of a set of parties communicating for the purpose of evaluating a function on their inputs, where each party receives at the end some output of the computation. In the game theoretic setting, parties interact in a game that guarantees some payoff for the participants according to the joint actions of all the parties, while the parties wish to maximize their own payoff. In the past few years the relationship between these two areas has been investigated with the hope of having cross fertilization and synergy. In this chapter we describe the two areas, the similarities and differences, and some of the new results stemming from their interaction. The first and second section will describe the cryptographic and the game theory settings (respectively). In the third section we contrast the two settings, and in the last sections we detail some of the existing results. Cryptographic Notions and Settings Cryptography is a vast subject requiring its own book. Therefore, in the following we will give only a high-level overview of the problem of Multi-Party Computation (MPC), ignoring most of the lower-level details and concentrating only on aspects relevant to Game Theory.",
author = "Yevgeniy Dodis and Tal Rabin",
year = "2007",
month = "1",
day = "1",
doi = "10.1017/CBO9780511800481.010",
language = "English (US)",
isbn = "9780511800481",
pages = "181--206",
booktitle = "Algorithmic Game Theory",
publisher = "Cambridge University Press",

}

TY - CHAP

T1 - Cryptography and game theory

AU - Dodis, Yevgeniy

AU - Rabin, Tal

PY - 2007/1/1

Y1 - 2007/1/1

N2 - The Cryptographic and Game Theory worlds seem to have an intersection in that they both deal with an interaction between mutually distrustful parties which has some end result. In the cryptographic setting the multiparty interaction takes the shape of a set of parties communicating for the purpose of evaluating a function on their inputs, where each party receives at the end some output of the computation. In the game theoretic setting, parties interact in a game that guarantees some payoff for the participants according to the joint actions of all the parties, while the parties wish to maximize their own payoff. In the past few years the relationship between these two areas has been investigated with the hope of having cross fertilization and synergy. In this chapter we describe the two areas, the similarities and differences, and some of the new results stemming from their interaction. The first and second section will describe the cryptographic and the game theory settings (respectively). In the third section we contrast the two settings, and in the last sections we detail some of the existing results. Cryptographic Notions and Settings Cryptography is a vast subject requiring its own book. Therefore, in the following we will give only a high-level overview of the problem of Multi-Party Computation (MPC), ignoring most of the lower-level details and concentrating only on aspects relevant to Game Theory.

AB - The Cryptographic and Game Theory worlds seem to have an intersection in that they both deal with an interaction between mutually distrustful parties which has some end result. In the cryptographic setting the multiparty interaction takes the shape of a set of parties communicating for the purpose of evaluating a function on their inputs, where each party receives at the end some output of the computation. In the game theoretic setting, parties interact in a game that guarantees some payoff for the participants according to the joint actions of all the parties, while the parties wish to maximize their own payoff. In the past few years the relationship between these two areas has been investigated with the hope of having cross fertilization and synergy. In this chapter we describe the two areas, the similarities and differences, and some of the new results stemming from their interaction. The first and second section will describe the cryptographic and the game theory settings (respectively). In the third section we contrast the two settings, and in the last sections we detail some of the existing results. Cryptographic Notions and Settings Cryptography is a vast subject requiring its own book. Therefore, in the following we will give only a high-level overview of the problem of Multi-Party Computation (MPC), ignoring most of the lower-level details and concentrating only on aspects relevant to Game Theory.

UR - http://www.scopus.com/inward/record.url?scp=70350294929&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350294929&partnerID=8YFLogxK

U2 - 10.1017/CBO9780511800481.010

DO - 10.1017/CBO9780511800481.010

M3 - Chapter

AN - SCOPUS:70350294929

SN - 9780511800481

SN - 9780521872829

SP - 181

EP - 206

BT - Algorithmic Game Theory

PB - Cambridge University Press

ER -