A complete characterization of game-theoretically fair, multi-party coin toss
From MaRDI portal
Publication:2169995
DOI10.1007/978-3-031-06944-4_5zbMath1496.94071OpenAlexW3184087095MaRDI QIDQ2169995
Elaine Shi, Gilad Asharov, Ke Wu
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_5
Related Items (2)
Short paper: On game-theoretically-fair leader election ⋮ \(\log^\ast\)-round game-theoretically-fair leader election
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subjectivity and correlation in randomized strategies
- Game theoretic notions of fairness in multi-party coin toss
- Fair distributed computation of reactive functions
- Verifiable delay functions
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- Utility dependence in correct and fair rational secret sharing
- Non-cooperative games
- How Fair is Your Protocol?
- Secure Multi-Party Computation with Identifiable Abort
- How to Use Bitcoin to Design Fair Protocols
- Fair Computation with Rational Players
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Towards a Game Theoretic View of Secure Computation
- Rational secret sharing and multiparty computation
- 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
This page was built for publication: A complete characterization of game-theoretically fair, multi-party coin toss
