\(\log^\ast\)-round game-theoretically-fair leader election

DOI10.1007/978-3-031-15982-4_14zbMath1517.94118OpenAlexW4312372623MaRDI QIDQ6108988

Ilan Komargodski, Ke Wu, Shin'ichiro Matsuo, Elaine Shi

Publication date: 30 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15982-4_14

zbMATH Keywords

round complexityround-fairness trade-offs

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Subjectivity and correlation in randomized strategies
• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Game theoretic notions of fairness in multi-party coin toss
• Fair distributed computation of reactive functions
• Game-theoretic fairness meets multi-party protocols: the case of leader election
• A complete characterization of game-theoretically fair, multi-party coin toss
• Utility dependence in correct and fair rational secret sharing
• Non-cooperative games
• How Fair is Your Protocol?
• How to Use Bitcoin to Design Fair Protocols
• Fair Computation with Rational Players
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
• Towards a Game Theoretic View of Secure Computation
• How to share a secret
• Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• Rational secret sharing and multiparty computation
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Protocols for Multiparty Coin Toss with Dishonest Majority
• An Optimally Fair Coin Toss
• Fairness with an Honest Minority and a Rational Majority
• Coin flipping by telephone a protocol for solving impossible problems
• Distributed computing meets game theory
• FruitChains
• Bridging Game Theory and Cryptography: Recent Results and Future Directions
• Verifiably Secure Devices
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Concurrent Non-malleable Commitments from Any One-Way Function
• Modeling Bitcoin Contracts by Timed Automata

This page was built for publication: \(\log^\ast\)-round game-theoretically-fair leader election