TY - GEN

T1 - Coin flipping of any constant bias implies one-way functions

AU - Berman, Itay

AU - Haitner, Iftach

AU - Tentes, Aris

PY - 2014

Y1 - 2014

N2 - We show that the existence of a coin-flipping protocol safe against any non-trivial constant bias (e.g., :499) implies the existence of one-way functions. This improves upon a re- cent 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

AB - We show that the existence of a coin-flipping protocol safe against any non-trivial constant bias (e.g., :499) implies the existence of one-way functions. This improves upon a re- cent 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

KW - Coin-ipping protocols

KW - Minimal hardness assumptions

KW - One-way functions

UR - http://www.scopus.com/inward/record.url?scp=84904308349&partnerID=8YFLogxK

U2 - 10.1145/2591796.2591845

DO - 10.1145/2591796.2591845

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84904308349

SN - 9781450327107

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 398

EP - 407

BT - STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing

PB - Association for Computing Machinery

T2 - 4th Annual ACM Symposium on Theory of Computing, STOC 2014

Y2 - 31 May 2014 through 3 June 2014

ER -