Coin Flipping of Any Constant Bias Implies One-Way Functions

05/04/2021
by   Itay Berman, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2021

On the Complexity of Fair Coin Flipping

A two-party coin-flipping protocol is ϵ-fair if no efficient adversary c...
research
10/29/2021

Non-existence results for vectorial bent functions with Dillon exponent

We prove new non-existence results for vectorial monomial Dillon type be...
research
02/23/2018

Definable isomorphism problem

We investigate the isomorphism problem in the setting of definable sets ...
research
05/03/2021

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling

In his seminal work, Cleve [STOC '86] has proved that any r-round coin-f...
research
06/26/2019

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland

Consider the following two fundamental open problems in complexity theor...
research
11/06/2018

Quantum Weak Coin Flipping

We investigate weak coin flipping, a fundamental cryptographic primitive...
research
10/10/2018

The Andoni--Krauthgamer--Razenshteyn characterization of sketchable norms fails for sketchable metrics

Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC 2015) that a fini...

Please sign up or login with your details

Forgot password? Click here to reset