文章基本信息
- 标题：Coin Flipping of Any Constant Bias Implies One-Way Functions
- 本地全文：下载
- 作者：Itay Berman ; Iftach Haitner ; Aris Tentes 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2015
- 卷号：2015
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
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 protocols with bias 2 2 − 1 − o (1) 207 . Unlike the result of Haitner and Omri, our result also holds for weak coin-flipping protocols.
- 关键词：coin-flipping protocols ; minimal hardness assumptions ; One-Way Functions
