Polynomial-time targeted attacks on coin tossing for any number of corruptions
From MaRDI portal
Publication:2697882
DOI10.1007/978-3-030-90453-1_25OpenAlexW3212020439MaRDI QIDQ2697882
Ji Gao, Mohammad Mahmoody, Omid Etesami, Saeed Mahloujifar
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_25
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some extremal problems arising from discrete control processes
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Unconditional and symmetric sets in \(n\)-dimensional normed spaces
- Blockwise \(p\)-tampering attacks on cryptographic primitives, extractors, and learners
- Concentration of measure and isoperimetric inequalities in product spaces
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- Adaptively Secure Coin-Flipping, Revisited
- An Optimally Fair Coin Toss
- A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols
- Computational Concentration of Measure: Optimal Bounds, Reductions, and More
- Optimal numberings and isoperimetric problems on graphs
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
- On the complexity of fair coin flipping
This page was built for publication: Polynomial-time targeted attacks on coin tossing for any number of corruptions
