log∗ -Round Game-Theoretically-Fair Leader Election

Ilan Komargodski; Shin’ichiro Matsuo; Elaine Shi; Ke Wu

doi:10.1007/978-3-031-15982-4_14

log^∗ -Round Game-Theoretically-Fair Leader Election

Ilan Komargodski^*, Shin’ichiro Matsuo, Elaine Shi, Ke Wu

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

1 Scopus citations

Abstract

It is well-known that in the presence of majority coalitions, strongly fair coin toss is impossible. A line of recent works have shown that by relaxing the fairness notion to game theoretic, we can overcome this classical lower bound. In particular, Chung et al. (CRYPTO’21) showed how to achieve approximately (game-theoretically) fair leader election in the presence of majority coalitions, with round complexity as small as O(log log n) rounds. In this paper, we revisit the round complexity of game-theoretically fair leader election. We construct O(log^∗n) rounds leader election protocols that achieve (1 - o(1 ) ) -approximate fairness in the presence of (1 - o(1 ) ) n -sized coalitions. Our protocols achieve the same round-fairness trade-offs as Chung et al.’s and have the advantage of being conceptually simpler. Finally, we also obtain game-theoretically fair protocols for committee election which might be of independent interest.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings
Editors	Yevgeniy Dodis, Thomas Shrimpton
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	409-438
Number of pages	30
ISBN (Print)	9783031159817
DOIs	https://doi.org/10.1007/978-3-031-15982-4_14
State	Published - 2022
Event	42nd Annual International Cryptology Conference, CRYPTO 2022 - Santa Barbara, United States Duration: 15 Aug 2022 → 18 Aug 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13509 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	42nd Annual International Cryptology Conference, CRYPTO 2022
Country/Territory	United States
City	Santa Barbara
Period	15/08/22 → 18/08/22

Bibliographical note

Funding Information:
This work is in part supported by NSF awards under the grant numbers 2044679 and 1704788, a Packard Fellowship, and a generous gift from Nikolai Mushegian.

Publisher Copyright:
© 2022, International Association for Cryptologic Research.

Access to Document

10.1007/978-3-031-15982-4_14

Cite this

Komargodski, I., Matsuo, S., Shi, E., & Wu, K. (2022). log^∗ -Round Game-Theoretically-Fair Leader Election. In Y. Dodis, & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 409-438). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13509 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-15982-4_14

Komargodski, Ilan ; Matsuo, Shin’ichiro ; Shi, Elaine et al. / log^∗ -Round Game-Theoretically-Fair Leader Election. Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. editor / Yevgeniy Dodis ; Thomas Shrimpton. Springer Science and Business Media Deutschland GmbH, 2022. pp. 409-438 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2348d4247aba4ed386a6e50161fc7ff3,

title = "log∗ -Round Game-Theoretically-Fair Leader Election",

abstract = "It is well-known that in the presence of majority coalitions, strongly fair coin toss is impossible. A line of recent works have shown that by relaxing the fairness notion to game theoretic, we can overcome this classical lower bound. In particular, Chung et al. (CRYPTO{\textquoteright}21) showed how to achieve approximately (game-theoretically) fair leader election in the presence of majority coalitions, with round complexity as small as O(log log n) rounds. In this paper, we revisit the round complexity of game-theoretically fair leader election. We construct O(log∗n) rounds leader election protocols that achieve (1 - o(1 ) ) -approximate fairness in the presence of (1 - o(1 ) ) n -sized coalitions. Our protocols achieve the same round-fairness trade-offs as Chung et al.{\textquoteright}s and have the advantage of being conceptually simpler. Finally, we also obtain game-theoretically fair protocols for committee election which might be of independent interest.",

author = "Ilan Komargodski and Shin{\textquoteright}ichiro Matsuo and Elaine Shi and Ke Wu",

note = "Publisher Copyright: {\textcopyright} 2022, International Association for Cryptologic Research.; 42nd Annual International Cryptology Conference, CRYPTO 2022 ; Conference date: 15-08-2022 Through 18-08-2022",

year = "2022",

doi = "10.1007/978-3-031-15982-4_14",

language = "אנגלית",

isbn = "9783031159817",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "409--438",

editor = "Yevgeniy Dodis and Thomas Shrimpton",

booktitle = "Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings",

address = "גרמניה",

}

Komargodski, I, Matsuo, S, Shi, E & Wu, K 2022, log^∗ -Round Game-Theoretically-Fair Leader Election. in Y Dodis & T Shrimpton (eds), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13509 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 409-438, 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, United States, 15/08/22. https://doi.org/10.1007/978-3-031-15982-4_14

log^∗ -Round Game-Theoretically-Fair Leader Election. / Komargodski, Ilan; Matsuo, Shin’ichiro; Shi, Elaine et al.
Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. ed. / Yevgeniy Dodis; Thomas Shrimpton. Springer Science and Business Media Deutschland GmbH, 2022. p. 409-438 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13509 LNCS).

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

TY - GEN

T1 - log∗ -Round Game-Theoretically-Fair Leader Election

AU - Komargodski, Ilan

AU - Matsuo, Shin’ichiro

AU - Shi, Elaine

AU - Wu, Ke

PY - 2022

Y1 - 2022

N2 - It is well-known that in the presence of majority coalitions, strongly fair coin toss is impossible. A line of recent works have shown that by relaxing the fairness notion to game theoretic, we can overcome this classical lower bound. In particular, Chung et al. (CRYPTO’21) showed how to achieve approximately (game-theoretically) fair leader election in the presence of majority coalitions, with round complexity as small as O(log log n) rounds. In this paper, we revisit the round complexity of game-theoretically fair leader election. We construct O(log∗n) rounds leader election protocols that achieve (1 - o(1 ) ) -approximate fairness in the presence of (1 - o(1 ) ) n -sized coalitions. Our protocols achieve the same round-fairness trade-offs as Chung et al.’s and have the advantage of being conceptually simpler. Finally, we also obtain game-theoretically fair protocols for committee election which might be of independent interest.

AB - It is well-known that in the presence of majority coalitions, strongly fair coin toss is impossible. A line of recent works have shown that by relaxing the fairness notion to game theoretic, we can overcome this classical lower bound. In particular, Chung et al. (CRYPTO’21) showed how to achieve approximately (game-theoretically) fair leader election in the presence of majority coalitions, with round complexity as small as O(log log n) rounds. In this paper, we revisit the round complexity of game-theoretically fair leader election. We construct O(log∗n) rounds leader election protocols that achieve (1 - o(1 ) ) -approximate fairness in the presence of (1 - o(1 ) ) n -sized coalitions. Our protocols achieve the same round-fairness trade-offs as Chung et al.’s and have the advantage of being conceptually simpler. Finally, we also obtain game-theoretically fair protocols for committee election which might be of independent interest.

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

U2 - 10.1007/978-3-031-15982-4_14

DO - 10.1007/978-3-031-15982-4_14

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

AN - SCOPUS:85141687886

SN - 9783031159817

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

SP - 409

EP - 438

BT - Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings

A2 - Dodis, Yevgeniy

A2 - Shrimpton, Thomas

PB - Springer Science and Business Media Deutschland GmbH

T2 - 42nd Annual International Cryptology Conference, CRYPTO 2022

Y2 - 15 August 2022 through 18 August 2022

ER -

Komargodski I, Matsuo S, Shi E, Wu K. log^∗ -Round Game-Theoretically-Fair Leader Election. In Dodis Y, Shrimpton T, editors, Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 409-438. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-15982-4_14