Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious

DOI10.1007/978-3-662-53641-4_13zbMath1406.94019OpenAlexW2535768635MaRDI QIDQ3179362

Bar Alon, Eran Omri

Publication date: 21 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

A lower bound for adaptively-secure collective coin flipping protocols ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Characterization of secure multiparty computation without broadcast ⋮ 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 ⋮ From fairness to full security in multiparty computation ⋮ A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

Cites Work

• Unnamed Item
• Unnamed Item
• Partial fairness in secure two-party computation
• Bit commitment using pseudorandomness
• Security and composition of multiparty cryptographic protocols
• Secure Multi-Party Computation with Identifiable Abort
• On the Classification of Finite Boolean Functions up to Fairness
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
• On the Black-Box Complexity of Optimally-Fair Coin Tossing
• How to share a secret
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• Partial Fairness in Secure Two-Party Computation
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Protocols for Multiparty Coin Toss with Dishonest Majority
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• An Optimally Fair Coin Toss
• Foundations of Cryptography
• Coin flipping by telephone a protocol for solving impossible problems
• A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
• 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
• Coin flipping of any constant bias implies one-way functions
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Coin Flipping with Constant Bias Implies One-Way Functions
• Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
• Towards Characterizing Complete Fairness in Secure Two-Party Computation

This page was built for publication: Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious