Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
From MaRDI portal
Publication:5096104
DOI10.1137/18M1210782zbMath1495.94042arXiv2105.00743OpenAlexW3157661792MaRDI QIDQ5096104
Iftach Haitner, Nikolaos Makriyannis, Amos Beimel, Eran Omri
Publication date: 12 August 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00743
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Generalizations of martingales (60G48)
Related Items (3)
Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ On the power of an honest majority in three-party computation without broadcast
Cites Work
- An optimally fair coin toss
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- Protocols for multiparty coin toss with a dishonest majority
- Characterization of Secure Multiparty Computation Without Broadcast
- 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
- Probability for Statistics and Machine Learning
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- The Algorithmic Foundations of Differential Privacy
- Partial Fairness in Secure Two-Party Computation
- Protocols for Multiparty Coin Toss with Dishonest Majority
- An Optimally Fair Coin Toss
- Complete Fairness in Multi-party Computation without an Honest Majority
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Secure Two-Party Computation
- A Class of Orthogonal Series Related to Martingales
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- Theory of Cryptography
- On the complexity of fair coin flipping
- From fairness to full security in multiparty computation
This page was built for publication: Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
