Game theoretic notions of fairness in multi-party coin toss
From MaRDI portal
Publication:1629437
DOI10.1007/978-3-030-03807-6_21zbMath1443.94051OpenAlexW2899294118MaRDI QIDQ1629437
Elaine Shi, Rafael Pass, Yue Guo, Kai-Min Chung, Wei-Kai Lin
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_21
Related Items (5)
Game-theoretic fairness meets multi-party protocols: the case of leader election ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ 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
- Unnamed Item
- Unnamed Item
- An optimally fair coin toss
- Partial fairness in secure two-party computation
- Coalition-proof Nash equilibria. I: Concepts
- Subjectivity and correlation in randomized strategies
- Game theoretic notions of fairness in multi-party coin toss
- Utility dependence in correct and fair rational secret sharing
- Protocols for multiparty coin toss with a dishonest majority
- Non-cooperative games
- How to Use Bitcoin to Design Fair Protocols
- Fair Computation with Rational Players
- The Bitcoin Backbone Protocol: Analysis and Applications
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Towards a Game Theoretic View of Secure Computation
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- Utility Dependence in Correct and Fair Rational Secret Sharing
- 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
- Coin Flipping of Any Constant Bias Implies One-Way Functions
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- Distributed computing meets game theory
- Analysis of the Blockchain Protocol in Asynchronous Networks
- 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
- Coin Flipping with Constant Bias Implies One-Way Functions
- Modeling Bitcoin Contracts by Timed Automata
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
This page was built for publication: Game theoretic notions of fairness in multi-party coin toss
