research-article

Public Access

Coin Flipping of Any Constant Bias Implies One-Way Functions

Authors:

Iftach Haitner,

Aris TentesAuthors Info & Claims

Journal of the ACM (JACM), Volume 65, Issue 3

Article No.: 14, Pages 1 - 95

https://doi.org/10.1145/2979676

Published: 13 March 2018 Publication History

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.

References

[1]

B. Averbuch, M. Blum, B. Chor, S. Goldwasser, and S. Micali. 1985. How to implement Bracha’s O(log n) Byzantine agreement algorithm. Unpublished manuscript.

[2]

A. Beimel, E. Omri, and I. Orlov. 2010. Protocols for multiparty coin toss with dishonest majority. In Advances in Cryptology (CRYPTO’10). 538--557.

Digital Library

[3]

I. Berman, I. Haitner, and A. Tentes. 2014. Coin flipping of any constant bias implies one-way functions. In Symposium on Theory of Computing (STOC’14). 398--407.

Digital Library

[4]

M. Blum. 1981. Coin flipping by telephone. In Advances in Cryptology (CRYPTO’81). 11--15.

[5]

A. Chailloux and I. Kerenidis. 2009. Optimal quantum strong coin flipping. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS’09). 527--533.

Digital Library

[6]

R. Cleve. 1986. Limits on the security of coin flips when half the processors are faulty. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC’86). 364--369.

Digital Library

[7]

R. Cleve and R. Impagliazzo. 1993. Martingales, collective coin flipping and discrete control processes (Extended Abstract). Retrieved from http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.1797.

[8]

D. Dachman-Soled, Y. Lindell, M. Mahmoody, and T. Malkin. 2011. On the black-box complexity of optimally-fair coin tossing. In Theory of Cryptography, 8th Theory of Cryptography Conference (TCC’11), Vol. 6597. 450--467.

Digital Library

[9]

O. Goldreich, S. Goldwasser, and S. Micali. 1984. On the cryptographic applications of random functions. In Advances in Cryptology (CRYPTO’84). 276--288.

Digital Library

[10]

O. Goldreich, S. Goldwasser, and S. Micali. 1986. How to construct random functions. J. ACM 33 (1986), 792--807. http://dblp.uni-trier.de/rec/bibtex/journals/jacm/GoldreichGM86.

Digital Library

[11]

O. Goldreich and L. A. Levin. 1989. A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC’89). 25--32.

Digital Library

[12]

I. Haitner, M. Nguyen, S. J. Ong, O. Reingold, and S. Vadhan. 2009. Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM J. Comput. 39, 3 (2009), 1153--1218.

Digital Library

[13]

I. Haitner and E. Omri. 2011. Coin flipping with constant bias implies one-way functions. In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS’11). 110--119.

Digital Library

[14]

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. 1999. A pseudorandom generator from any one-way function. SIAM J. Comput. 28 (1999), 1364--1396. Preliminary versions in STOC’89 and STOC’90. http://dblp.uni-rier.de/rec/bibtex/journals/siamcomp/HastadILL99.

Digital Library

[15]

R. Impagliazzo. Pseudo-random generators for cryptography and for randomized algorithms. Ph.D. Thesis. Retrieved from http://cseweb.ucsd.edu/russell/format.ps.

[16]

R. Impagliazzo and M. Luby. 1989. One-way functions are essential for complexity based cryptography. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS’89). 230--235.

Digital Library

[17]

A. Y. Kitaev. 2003. Quantum coin-flipping. (2003). Presentation at the 6th Workshop on Quantum Information Processing (QIP’03).

[18]

H. K. Maji, M. Prabhakaran, and A. Sahai. 2010. On the computational complexity of coin flipping. In Proceedings of the 51st Annual Symposium on Foundations of Computer Science (FOCS’10). 613--622.

Digital Library

[19]

C. Mochon. 2007. Quantum weak coin flipping with arbitrarily small bias. arXiv:0711.4114. (2007).

[20]

T. Moran, M. Naor, and G. Segev. 2009. An optimally fair coin toss. In Theory of Cryptography, 6th Theory of Cryptography Conference (TCC’09). 1--18.

Digital Library

[21]

M. Naor. 1991. Bit commitment using pseudorandomness. J. Cryptol. 4 (1991), 151--158. Preliminary version in CRYPTO’89. http://dblp.uni-trier.de/rec/bibtex/journals/joc/Naor91.

Digital Library

[22]

M. Naor and M. Yung. 1989. Universal one-way hash functions and their cryptographic applications. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC’89). 33--43.

Digital Library

[23]

A. Wayne Roberts and D. E. Varberg. 1973. Convex Functions. Academic Press.

[24]

J. Rompel. 1990. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC’90). 387--394.

Digital Library

[25]

S. Zachos. 1986. Probabilistic quantifiers, adversaries, and complexity classes: An overview. In Proceedings of the 1st Annual IEEE Conference on Computational Complexity. 383--400.

Digital Library

Cited By

Thyagarajan SSoni PWu K(2024)Game-Theoretically Fair Distributed SamplingAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_7(207-239)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68397-8_7
Haitner IMazor NSilbak JTsfadia ELeonardi SGupta A(2022)On the complexity of two-party differential privacyProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519982(1392-1405)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3519982
Haitner IMakriyannis NOmri E(2022)On the complexity of fair coin flippingTheoretical Computer Science10.1016/j.tcs.2022.02.010914(23-38)Online publication date: May-2022
https://doi.org/10.1016/j.tcs.2022.02.010
Show More Cited By

Index Terms

Coin Flipping of Any Constant Bias Implies One-Way Functions
1. Security and privacy
  1. Cryptography
    1. Mathematical foundations of cryptography
2. Theory of computation
  1. Computational complexity and cryptography
    1. Cryptographic primitives

Recommendations

Coin Flipping with Constant Bias Implies One-Way Functions
FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

It is well known (cf., Impagliazzo and Luby [FOCS '89]) 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 ...
Coin flipping of any constant bias implies one-way functions
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

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 recent result of Haitner and Omri [FOCS '11], who proved this implication for ...
An almost-optimally fair three-party coin-flipping protocol
STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

In a multiparty fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some corrupted parties try to bias the output. Cleve [STOC 1986] has shown that in the case of dishonest majority (i.e., at least half of the ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 65, Issue 3

June 2018

285 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/3191817

Editor:
Éva Tardos
Cornell University

Issue’s Table of Contents

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 March 2018

Accepted: 01 November 2017

Revised: 01 February 2017

Received: 01 June 2015

Published in JACM Volume 65, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Israeli Centers of Research Excellence (I-CORE)
United states - Israel Binational Science Foundation
Defense Advanced Research Projects Agency (DARPA)
Check Point Institute for Information Security
Israel Science Foundation (ISF)
U.S. Army Research Office
National Science Foundation (NSF)

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
397
Total Downloads

Downloads (Last 12 months)79
Downloads (Last 6 weeks)10

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Thyagarajan SSoni PWu K(2024)Game-Theoretically Fair Distributed SamplingAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_7(207-239)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68397-8_7
Haitner IMazor NSilbak JTsfadia ELeonardi SGupta A(2022)On the complexity of two-party differential privacyProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519982(1392-1405)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3519982
Haitner IMakriyannis NOmri E(2022)On the complexity of fair coin flippingTheoretical Computer Science10.1016/j.tcs.2022.02.010914(23-38)Online publication date: May-2022
https://doi.org/10.1016/j.tcs.2022.02.010
Haitner IKaridi-Heller Y(2020)A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00120(1268-1276)Online publication date: Nov-2020
https://doi.org/10.1109/FOCS46700.2020.00120
Kalai YKomargodski IRaz R(2020)A Lower Bound for Adaptively-Secure Collective Coin Flipping ProtocolsCombinatorica10.1007/s00493-020-4147-4Online publication date: 30-Nov-2020
https://doi.org/10.1007/s00493-020-4147-4
Chung KGuo YLin WPass RShi E(2018)Game Theoretic Notions of Fairness in Multi-party Coin TossTheory of Cryptography10.1007/978-3-030-03807-6_21(563-596)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.1007/978-3-030-03807-6_21
Haitner IMakriyannis NOmri E(2018)On the Complexity of Fair Coin FlippingTheory of Cryptography10.1007/978-3-030-03807-6_20(539-562)Online publication date: 11-Nov-2018
https://dl.acm.org/doi/10.1007/978-3-030-03807-6_20

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents