Game-theoretic fairness meets multi-party protocols: the case of leader election
From MaRDI portal
Publication:2128554
DOI10.1007/978-3-030-84245-1_1zbMath1486.94090OpenAlexW3188735161MaRDI QIDQ2128554
Ting Wen, Elaine Shi, Kai-Min Chung, T.-H. Hubert Chan
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_1
Related Items (3)
A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Short paper: On game-theoretically-fair leader election ⋮ \(\log^\ast\)-round game-theoretically-fair leader election
Cites Work
- Unnamed Item
- Unnamed Item
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Game theoretic notions of fairness in multi-party coin toss
- Fair distributed computation of reactive functions
- Verifiable delay functions
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- How Fair is Your Protocol?
- How To Elect a Leader Faster than a Tournament
- Lower bounds for leader election and collective coin-flipping in the perfect information model
- How to Use Bitcoin to Design Fair Protocols
- Distributed Protocols for Leader Election: A Game-Theoretic Perspective
- On the time and space complexity of randomized test-and-set
- Sub-logarithmic Test-and-Set against a Weak Adversary
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Fast Randomized Test-and-Set and Renaming
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Coin flipping by telephone a protocol for solving impossible problems
- FruitChains
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
This page was built for publication: Game-theoretic fairness meets multi-party protocols: the case of leader election
