A complete characterization of game-theoretically fair, multi-party coin toss
From MaRDI portal
Publication:2169995
Recommendations
- Game theoretic notions of fairness in multi-party coin toss
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Fair coin flipping: tighter analysis and the many-party case
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- \(\log^\ast\)-round game-theoretically-fair leader election
Cites work
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Coin flipping by telephone a protocol for solving impossible problems
- Cryptography and game theory
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Distributed computing meets game theory
- Fair computation with rational players
- Fair distributed computation of reactive functions
- Fairness with an Honest Minority and a Rational Majority
- FruitChains: a fair blockchain
- Game theoretic notions of fairness in multi-party coin toss
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- How fair is your protocol? A utility-based approach to protocol optimality
- How to use bitcoin to design fair protocols
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 1759774 (Why is no real title available?)
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Non-cooperative games
- Rational secret sharing and multiparty computation
- Secure multi-party computation with identifiable abort
- Subjectivity and correlation in randomized strategies
- Towards a game theoretic view of secure computation
- Utility dependence in correct and fair rational secret sharing
- Verifiable delay functions
- Verifiably Secure Devices
Cited in
(11)- Game theoretic notions of fairness in multi-party coin toss
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Short paper: On game-theoretically-fair leader election
- \(\log^\ast\)-round game-theoretically-fair leader election
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
- Game-theoretically fair distributed sampling
- Maximizing miner revenue in transaction fee mechanism design
- On the (im)possibility of game-theoretically fair leader election protocols
- Game-theoretically fair coin toss with arbitrary preferences
- Game theory does not always help: the case of statistical multi-party coin tossing
This page was built for publication: A complete characterization of game-theoretically fair, multi-party coin toss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169995)
