Game-theoretic fairness meets multi-party protocols: the case of leader election
From MaRDI portal
Publication:2128554
DOI10.1007/978-3-030-84245-1_1zbMATH Open1486.94090OpenAlexW3188735161MaRDI QIDQ2128554FDOQ2128554
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Coin flipping by telephone a protocol for solving impossible problems
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Distributed Protocols for Leader Election: A Game-Theoretic Perspective
- How to Use Bitcoin to Design Fair Protocols
- Verifiable delay functions
- Fair distributed computation of reactive functions
- Game theoretic notions of fairness in multi-party coin toss
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- FruitChains
- How fair is your protocol? A utility-based approach to protocol optimality
- On the time and space complexity of randomized test-and-set
- Sub-logarithmic Test-and-Set against a Weak Adversary
- Fast Randomized Test-and-Set and Renaming
- How to elect a leader faster than a tournament
- Lower bounds for leader election and collective coin-flipping in the perfect information model
Cited In (6)
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
- Game-theoretically secure protocols for the ordinal random assignment problem
- Short paper: On game-theoretically-fair leader election
- A complete characterization of game-theoretically fair, multi-party coin toss
- Game-theoretically fair distributed sampling
- \(\log^\ast\)-round game-theoretically-fair leader election
This page was built for publication: Game-theoretic fairness meets multi-party protocols: the case of leader election
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128554)
