A cryptographic solution to a game theoretic problem

Yevgeniy Dodis, Shai Halevi, Tal Rabin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for such games is that of an equilibrium, which is a pair of “self-enforcing” strategies making each player’s strategy an optimal response to the other player’s strategy. It is known that for many games the expected equilibrium payoffs can be much higher when a trusted third party (a “mediator”) assists the players in choosing their moves (correlated equilibria), than when each player has to choose its move on its own (Nash equilibria). It is natural to ask whether there exists a mechanism that eliminates the need for the mediator yet allows the players to maintain the high payoffs offered by mediator-assisted strategies. We answer this question affirmatively provided the players are computationally bounded and can have free communication (so-called “cheap talk”) prior to playing the game. The main building block of our solution is an efficient cryptographic protocol to the following Correlated Element Selection problem, which is of independent interest. Both Alice and Bob know a list of pairs (a1, b1)… (an, bn) (possibly with repetitions), and they want to pick a random index i such that Alice learns only ai and Bob learns only bi. Our solution to this problem has constant number of rounds, negligible error probability, and uses only very simple zero-knowledge proofs. We then show how to incorporate our cryptographic protocol back into a game-theoretic setting, which highlights some interesting parallels between cryptographic protocols and extensive form games.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings
PublisherSpringer Verlag
Pages112-130
Number of pages19
Volume1880
ISBN (Print)9783540445982
StatePublished - 2000
Event20th Annual International Cryptology Conference, CRYPTO 2000 - Santa Barbara, United States
Duration: Aug 20 2000Aug 24 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1880
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other20th Annual International Cryptology Conference, CRYPTO 2000
CountryUnited States
CitySanta Barbara
Period8/20/008/24/00

Fingerprint

Cryptography
Game
Communication
Cryptographic Protocols
Mediator
Zero-knowledge Proof
Solution Concepts
Error probability
Error Probability
Nash Equilibrium
Building Blocks
Eliminate
Choose
Strategy

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dodis, Y., Halevi, S., & Rabin, T. (2000). A cryptographic solution to a game theoretic problem. In Advances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings (Vol. 1880, pp. 112-130). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1880). Springer Verlag.

A cryptographic solution to a game theoretic problem. / Dodis, Yevgeniy; Halevi, Shai; Rabin, Tal.

Advances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings. Vol. 1880 Springer Verlag, 2000. p. 112-130 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1880).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dodis, Y, Halevi, S & Rabin, T 2000, A cryptographic solution to a game theoretic problem. in Advances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings. vol. 1880, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1880, Springer Verlag, pp. 112-130, 20th Annual International Cryptology Conference, CRYPTO 2000, Santa Barbara, United States, 8/20/00.
Dodis Y, Halevi S, Rabin T. A cryptographic solution to a game theoretic problem. In Advances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings. Vol. 1880. Springer Verlag. 2000. p. 112-130. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Dodis, Yevgeniy ; Halevi, Shai ; Rabin, Tal. / A cryptographic solution to a game theoretic problem. Advances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings. Vol. 1880 Springer Verlag, 2000. pp. 112-130 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{950e3a7dced94b399a97e974f7ad66b0,
title = "A cryptographic solution to a game theoretic problem",
abstract = "In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for such games is that of an equilibrium, which is a pair of “self-enforcing” strategies making each player’s strategy an optimal response to the other player’s strategy. It is known that for many games the expected equilibrium payoffs can be much higher when a trusted third party (a “mediator”) assists the players in choosing their moves (correlated equilibria), than when each player has to choose its move on its own (Nash equilibria). It is natural to ask whether there exists a mechanism that eliminates the need for the mediator yet allows the players to maintain the high payoffs offered by mediator-assisted strategies. We answer this question affirmatively provided the players are computationally bounded and can have free communication (so-called “cheap talk”) prior to playing the game. The main building block of our solution is an efficient cryptographic protocol to the following Correlated Element Selection problem, which is of independent interest. Both Alice and Bob know a list of pairs (a1, b1)… (an, bn) (possibly with repetitions), and they want to pick a random index i such that Alice learns only ai and Bob learns only bi. Our solution to this problem has constant number of rounds, negligible error probability, and uses only very simple zero-knowledge proofs. We then show how to incorporate our cryptographic protocol back into a game-theoretic setting, which highlights some interesting parallels between cryptographic protocols and extensive form games.",
author = "Yevgeniy Dodis and Shai Halevi and Tal Rabin",
year = "2000",
language = "English (US)",
isbn = "9783540445982",
volume = "1880",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "112--130",
booktitle = "Advances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings",
address = "Germany",

}

TY - GEN

T1 - A cryptographic solution to a game theoretic problem

AU - Dodis, Yevgeniy

AU - Halevi, Shai

AU - Rabin, Tal

PY - 2000

Y1 - 2000

N2 - In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for such games is that of an equilibrium, which is a pair of “self-enforcing” strategies making each player’s strategy an optimal response to the other player’s strategy. It is known that for many games the expected equilibrium payoffs can be much higher when a trusted third party (a “mediator”) assists the players in choosing their moves (correlated equilibria), than when each player has to choose its move on its own (Nash equilibria). It is natural to ask whether there exists a mechanism that eliminates the need for the mediator yet allows the players to maintain the high payoffs offered by mediator-assisted strategies. We answer this question affirmatively provided the players are computationally bounded and can have free communication (so-called “cheap talk”) prior to playing the game. The main building block of our solution is an efficient cryptographic protocol to the following Correlated Element Selection problem, which is of independent interest. Both Alice and Bob know a list of pairs (a1, b1)… (an, bn) (possibly with repetitions), and they want to pick a random index i such that Alice learns only ai and Bob learns only bi. Our solution to this problem has constant number of rounds, negligible error probability, and uses only very simple zero-knowledge proofs. We then show how to incorporate our cryptographic protocol back into a game-theoretic setting, which highlights some interesting parallels between cryptographic protocols and extensive form games.

AB - In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for such games is that of an equilibrium, which is a pair of “self-enforcing” strategies making each player’s strategy an optimal response to the other player’s strategy. It is known that for many games the expected equilibrium payoffs can be much higher when a trusted third party (a “mediator”) assists the players in choosing their moves (correlated equilibria), than when each player has to choose its move on its own (Nash equilibria). It is natural to ask whether there exists a mechanism that eliminates the need for the mediator yet allows the players to maintain the high payoffs offered by mediator-assisted strategies. We answer this question affirmatively provided the players are computationally bounded and can have free communication (so-called “cheap talk”) prior to playing the game. The main building block of our solution is an efficient cryptographic protocol to the following Correlated Element Selection problem, which is of independent interest. Both Alice and Bob know a list of pairs (a1, b1)… (an, bn) (possibly with repetitions), and they want to pick a random index i such that Alice learns only ai and Bob learns only bi. Our solution to this problem has constant number of rounds, negligible error probability, and uses only very simple zero-knowledge proofs. We then show how to incorporate our cryptographic protocol back into a game-theoretic setting, which highlights some interesting parallels between cryptographic protocols and extensive form games.

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

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

M3 - Conference contribution

SN - 9783540445982

VL - 1880

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 112

EP - 130

BT - Advances in Cryptology - CRYPTO 2000 - 20th Annual International Cryptology Conference, Proceedings

PB - Springer Verlag

ER -