Coin flipping of any constant bias implies one-way functions

Itay Berman, Iftach Haitner, Aris Tentes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

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

Original languageEnglish
Title of host publicationSTOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing
PublisherAssociation for Computing Machinery
Pages398-407
Number of pages10
ISBN (Print)9781450327107
DOIs
StatePublished - 2014
Event4th Annual ACM Symposium on Theory of Computing, STOC 2014 - New York, NY, United States
Duration: 31 May 20143 Jun 2014

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference4th Annual ACM Symposium on Theory of Computing, STOC 2014
Country/TerritoryUnited States
CityNew York, NY
Period31/05/143/06/14

Funding

FundersFunder number
Horizon 2020 Framework Programme638121
Horizon 2020 Framework Programme

    Keywords

    • Coin-ipping protocols
    • Minimal hardness assumptions
    • One-way functions

    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