Coin Flipping of Any Constant Bias Implies One-Way Functions

Itay Berman; Iftach Haitner; Aris Tentes

doi:https://doi.org/10.1145/2979676

Coin Flipping of Any Constant Bias Implies One-Way Functions

Itay Berman, Iftach Haitner, Aris Tentes

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1145/2979676
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

Access to Document

https://doi.org/10.1145/2979676

Cite this

@article{1c12918a775f49e0b31c65c2eb8d4985,

title = "Coin Flipping of Any Constant Bias Implies One-Way Functions",

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.",

keywords = "Coin-flipping protocols, minimal hardness assumptions, one-way functions",

author = "Itay Berman and Iftach Haitner and Aris Tentes",

note = "Publisher Copyright: {\textcopyright} 2018 ACM.",

year = "2018",

month = mar,

day = "13",

doi = "https://doi.org/10.1145/2979676",

language = "الإنجليزيّة",

volume = "65",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Coin Flipping of Any Constant Bias Implies One-Way Functions

AU - Berman, Itay

AU - Haitner, Iftach

AU - Tentes, Aris

PY - 2018/3/13

Y1 - 2018/3/13

N2 - 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.

AB - 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.

KW - Coin-flipping protocols

KW - minimal hardness assumptions

KW - one-way functions

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

U2 - https://doi.org/10.1145/2979676

DO - https://doi.org/10.1145/2979676

M3 - مقالة

SN - 0004-5411

VL - 65

JO - Journal of the ACM

JF - Journal of the ACM

IS - 3

M1 - 14

ER -

Coin Flipping of Any Constant Bias Implies One-Way Functions

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this