An optimally fair coin toss
From MaRDI portal
Publication:315542
DOI10.1007/s00145-015-9199-zzbMath1348.94070OpenAlexW2043009352MaRDI QIDQ315542
Gil Segev, Tal Moran, 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
Related Items
A lower bound for adaptively-secure collective coin flipping protocols, Game theoretic notions of fairness in multi-party coin toss, Another step towards realizing random oracles: non-malleable point obfuscation, Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling, Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract), On actively-secure elementary MPC reductions, On the (im-)possibility of extending coin toss, On the power of an honest majority in three-party computation without broadcast, On the complexity of fair coin flipping, On the complexity of fair coin flipping, A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Partial fairness in secure two-party computation
- Bit commitment using pseudorandomness
- Efficient secure two-party protocols. Techniques and constructions
- New hash functions and their use in authentication and set equality
- Parallel coin-tossing and constant-round secure two-party computation
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- A new protocol and lower bounds for quantum coin flipping
- Security and composition of multiparty cryptographic protocols
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Quantum bit escrow
- Rational Secret Sharing, Revisited
- Rational secret sharing and multiparty computation
- Protocols for Multiparty Coin Toss with Dishonest Majority
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- A Robust Noncryptographic Protocol for Collective Coin Flipping
- Coin-Flipping Games Immune against Linear-Sized Coalitions
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- 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
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
