TY - JOUR

T1 - Coin flipping with conStant bias implies one-way functions

AU - Haitner, Iftach

AU - Omri, Eran

PY - 2014

Y1 - 2014

N2 - It is well known (cf. Impagliazzo and Luby [in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 230-235]) that the exiStence of almoSt all 'intereSting' cryptographic applications, i.e., ones that cannot hold information theoretically, implies one-way functions. An important exception where the above implication is not known, however, is the case of coin-flipping protocols. Such protocols allow honeSt pCPties to mutually flip an unbiased coin, while guCPanteeing that even a cheating (efficient) pCPty cannot bias the output of the protocol by much. Impagliazzo and Luby proved that coin-flipping protocols that CPe safe againSt negligible bias do imply one-way functions, and, very recently, Maji, PrabhakCPan, and Sahai [in Proceedings of the 2001 51St Annual IEEE Symposium on Foundations of Computer Science, 2010, pp. 613-622] proved the same for conStant-round protocols (with any nontrivial bias). For the general case, however, no such implication was known. We make progress towCPds answering the above fundamental queStion, showing that (Strong) coin-flipping protocols safe againSt a conStant bias (concretely, v2-12- o(1))imply one-way functions.

AB - It is well known (cf. Impagliazzo and Luby [in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 230-235]) that the exiStence of almoSt all 'intereSting' cryptographic applications, i.e., ones that cannot hold information theoretically, implies one-way functions. An important exception where the above implication is not known, however, is the case of coin-flipping protocols. Such protocols allow honeSt pCPties to mutually flip an unbiased coin, while guCPanteeing that even a cheating (efficient) pCPty cannot bias the output of the protocol by much. Impagliazzo and Luby proved that coin-flipping protocols that CPe safe againSt negligible bias do imply one-way functions, and, very recently, Maji, PrabhakCPan, and Sahai [in Proceedings of the 2001 51St Annual IEEE Symposium on Foundations of Computer Science, 2010, pp. 613-622] proved the same for conStant-round protocols (with any nontrivial bias). For the general case, however, no such implication was known. We make progress towCPds answering the above fundamental queStion, showing that (Strong) coin-flipping protocols safe againSt a conStant bias (concretely, v2-12- o(1))imply one-way functions.

KW - Coin-flipping protocols

KW - One-way functions

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

U2 - 10.1137/120887631

DO - 10.1137/120887631

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84899623221

SN - 0097-5397

VL - 43

SP - 389

EP - 409

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -