An Optimally Fair Coin Toss
From MaRDI portal
Recommendations
Cited in
(41)- Incentive-driven attacker for corrupting two-party protocols
- Characterization of secure multiparty computation without broadcast
- On the (im-)possibility of extending coin toss
- What security can we achieve within 4 rounds?
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Computational hardness of optimal fair computation: beyond Minicrypt
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Leakage-resilient coin tossing
- Basing cryptographic protocols on tamper-evident seals
- Protocols for multiparty coin toss with a dishonest majority
- Polynomial-time targeted attacks on coin tossing for any number of corruptions
- Achieving Optimal Fairness from Biased Coinflips
- Characterization of secure multiparty computation without broadcast
- What Security Can We Achieve Within 4 Rounds?
- Robust Coin Flipping
- Leakage-Resilient Coin Tossing
- An optimally fair coin toss
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- scientific article; zbMATH DE number 4191105 (Why is no real title available?)
- On the (Im-)Possibility of Extending Coin Toss
- The Round Complexity of Two-Party Random Selection
- On the Influence of Single Participant in Coin Flipping Schemes
- Partial fairness in secure two-party computation
- scientific article; zbMATH DE number 3000048 (Why is no real title available?)
- scientific article; zbMATH DE number 1754600 (Why is no real title available?)
- Coin flipping of \textit{any} constant bias implies one-way functions
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- scientific article; zbMATH DE number 5589306 (Why is no real title available?)
- Optimal coin flipping
- Coin flipping with constant bias implies one-way functions
- Automata, Languages and Programming
- Can optimally-fair coin tossing be based on one-way functions?
- On the complexity of fair coin flipping
- On the complexity of fair coin flipping
- \(\log^\ast\)-round game-theoretically-fair leader election
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Resource fairness and composability of cryptographic protocols
- Just how fair is an unreactive world?
- Information-theoretic single-server PIR in the shuffle model
This page was built for publication: An Optimally Fair Coin Toss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611755)
