Fair Coin Flipping: Tighter Analysis and the Many-Party Case

DOI10.1137/1.9781611974782.170zbMath1414.94909arXiv2104.08820OpenAlexW3168804117MaRDI QIDQ4575919

Niv Buchbinder, Eliad Tsfadia, Iftach Haitner, Nissan Levi

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.08820

zbMATH Keywords

coin-flippingfair computationstopping-time problems

Mathematics Subject Classification ID

Cryptography (94A60) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (15)

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 ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ 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 ⋮ 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

This page was built for publication: Fair Coin Flipping: Tighter Analysis and the Many-Party Case