Abstract
We show that the existence of a coin-flipping protocol safe against any nontrivial constant bias (e.g.,.499) implies the existence of one-way functions. This improves upon a result of Haitner and Omri (FOCS'11), who proved this implication for protocols with bias 2-1/2-o(1) ≈.207. Unlike the result of Haitner and Omri, our result also holds for weak coin-flipping protocols.
| Original language | English |
|---|---|
| Article number | 14 |
| Journal | Journal of the ACM |
| Volume | 65 |
| Issue number | 3 |
| DOIs | |
| State | Published - 13 Mar 2018 |
Keywords
- Coin-flipping protocols
- minimal hardness assumptions
- one-way functions
All Science Journal Classification (ASJC) codes
- Software
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence
Fingerprint
Dive into the research topics of 'Coin Flipping of Any Constant Bias Implies One-Way Functions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver