Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
From MaRDI portal
Publication:2175944
DOI10.1007/978-3-030-36033-7_13zbMath1455.94171arXiv1907.01694OpenAlexW2991045807MaRDI QIDQ2175944
Hemanta K. Maji, Tamalika Mukherjee, Hamidreza Amini Khorasgani
Publication date: 30 April 2020
Full work available at URL: https://arxiv.org/abs/1907.01694
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (5)
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 ⋮ Completeness theorems for adaptively secure broadcast ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
Cites Work
- Unnamed Item
- Unnamed Item
- Some extremal problems arising from discrete control processes
- Extracting randomness: A survey and new constructions
- Simulating BPP using a general weak random source
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- Weighted sums of certain dependent random variables
- 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
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- Adaptively Secure Coin-Flipping, Revisited
- Partial Fairness in Secure Two-Party Computation
- Protocols for Multiparty Coin Toss with Dishonest Majority
- Does Privacy Require True Randomness?
- An Optimally Fair Coin Toss
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
- Limits on the Usefulness of Random Oracles
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
- 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
- Probability Inequalities for Sums of Bounded Random Variables
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- Theory of Cryptography
This page was built for publication: Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
