Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation

Ittai Abraham; Danny Dolev; Rica Gonen; Joe Halpern

Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation

Ittai Abraham, Danny Dolev, Rica Gonen, Joe Halpern

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study k-resilient Nash equilibria, joint strategies where no member of a coalition C of size up to k can do better, even if the whole coalition defects. We show that such k-resillent Nash equilibria exist for secret sharing and multiparty computation, provided that players prefer to get the information than not to get it. Our results hold even if there are only 2 players, so we can do multiparty computation with only two rational agents. We extend our results so that they hold even in the presence of up to t players with " unexpected" utilities. Finally, we show that our techniques can be used to simulate games with mediators by games without mediators.

Original language	English
Title of host publication	Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006
Pages	53-62
Number of pages	10
State	Published - 2006
Externally published	Yes
Event	25th Annual ACM Symposium on Principles of Distributed Computing 2006 - Denver, CO, United States Duration: 23 Jul 2006 → 26 Jul 2006

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume	2006

Conference

Conference	25th Annual ACM Symposium on Principles of Distributed Computing 2006
Country/Territory	United States
City	Denver, CO
Period	23/07/06 → 26/07/06

Keywords

Distributed Computing
Game Theory
Secret Sharing
Secure Multiparty Computation

Cite this

@inproceedings{68e35c7fdff84cd3afd7b0278f591d72,

title = "Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation",

abstract = "We study k-resilient Nash equilibria, joint strategies where no member of a coalition C of size up to k can do better, even if the whole coalition defects. We show that such k-resillent Nash equilibria exist for secret sharing and multiparty computation, provided that players prefer to get the information than not to get it. Our results hold even if there are only 2 players, so we can do multiparty computation with only two rational agents. We extend our results so that they hold even in the presence of up to t players with {"} unexpected{"} utilities. Finally, we show that our techniques can be used to simulate games with mediators by games without mediators.",

keywords = "Distributed Computing, Game Theory, Secret Sharing, Secure Multiparty Computation",

author = "Ittai Abraham and Danny Dolev and Rica Gonen and Joe Halpern",

year = "2006",

language = "אנגלית",

isbn = "1595933840",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "53--62",

booktitle = "Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006",

}

Abraham, I, Dolev, D, Gonen, R & Halpern, J 2006, Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. in Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. 2006, pp. 53-62, 25th Annual ACM Symposium on Principles of Distributed Computing 2006, Denver, CO, United States, 23/07/06.

Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. / Abraham, Ittai; Dolev, Danny; Gonen, Rica et al.
Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006. 2006. p. 53-62 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Distributed computing meets game theory

T2 - 25th Annual ACM Symposium on Principles of Distributed Computing 2006

AU - Abraham, Ittai

AU - Dolev, Danny

AU - Gonen, Rica

AU - Halpern, Joe

PY - 2006

Y1 - 2006

N2 - We study k-resilient Nash equilibria, joint strategies where no member of a coalition C of size up to k can do better, even if the whole coalition defects. We show that such k-resillent Nash equilibria exist for secret sharing and multiparty computation, provided that players prefer to get the information than not to get it. Our results hold even if there are only 2 players, so we can do multiparty computation with only two rational agents. We extend our results so that they hold even in the presence of up to t players with " unexpected" utilities. Finally, we show that our techniques can be used to simulate games with mediators by games without mediators.

AB - We study k-resilient Nash equilibria, joint strategies where no member of a coalition C of size up to k can do better, even if the whole coalition defects. We show that such k-resillent Nash equilibria exist for secret sharing and multiparty computation, provided that players prefer to get the information than not to get it. Our results hold even if there are only 2 players, so we can do multiparty computation with only two rational agents. We extend our results so that they hold even in the presence of up to t players with " unexpected" utilities. Finally, we show that our techniques can be used to simulate games with mediators by games without mediators.

KW - Distributed Computing

KW - Game Theory

KW - Secret Sharing

KW - Secure Multiparty Computation

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33748686155

SN - 1595933840

SN - 9781595933843

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 53

EP - 62

BT - Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006

Y2 - 23 July 2006 through 26 July 2006

ER -

Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this