An optimally fair coin toss
From MaRDI portal
Publication:315542
DOI10.1007/S00145-015-9199-ZzbMATH Open1348.94070OpenAlexW2043009352MaRDI QIDQ315542FDOQ315542
Authors: Tal Moran, Gil Segev, Moni Naor 
Publication date: 21 September 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-015-9199-z
Recommendations
Cites Work
- New hash functions and their use in authentication and set equality
- Quantum bit escrow
- A Pseudorandom Generator from any One-way Function
- Bit commitment using pseudorandomness
- Parallel coin-tossing and constant-round secure two-party computation
- Security and composition of multiparty cryptographic protocols
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Foundations of Cryptography
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Can optimally-fair coin tossing be based on one-way functions?
- Efficient secure two-party protocols. Techniques and constructions
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- A new protocol and lower bounds for quantum coin flipping
- Rational Secret Sharing, Revisited
- Title not available (Why is that?)
- Complete fairness in secure two-party computation
- Rational secret sharing and multiparty computation
- Protocols for multiparty coin toss with dishonest majority
- A Robust Noncryptographic Protocol for Collective Coin Flipping
- Coin-Flipping Games Immune against Linear-Sized Coalitions
- Partial fairness in secure two-party computation
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- Coin flipping of any constant bias implies one-way functions
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Coin Flipping with Constant Bias Implies One-Way Functions
- Automata, Languages and Programming
Cited In (22)
- A lower bound for adaptively-secure collective coin flipping protocols
- Coin flipping from a cosmic source: On error correction of truly random bits
- On the (im-)possibility of extending coin toss
- Robust Coin Flipping
- Achieving Optimal Fairness from Biased Coinflips
- On the power of an honest majority in three-party computation without broadcast
- Another step towards realizing random oracles: non-malleable point obfuscation
- On actively-secure elementary MPC reductions
- Title not available (Why is that?)
- Game theoretic notions of fairness in multi-party coin toss
- Optimal coin flipping
- On the complexity of fair coin flipping
- Title not available (Why is that?)
- Can optimally-fair coin tossing be based on one-way functions?
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- A lower bound for adaptively-secure collective coin-flipping protocols
- Game-theoretically fair distributed sampling
- The round complexity of statistical MPC with optimal resiliency
- An Optimally Fair Coin Toss
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- On the complexity of fair coin flipping
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 Q315542)
