Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
From MaRDI portal
Publication:5746339
DOI10.1007/978-3-642-54242-8_10zbMath1323.94108OpenAlexW105146527MaRDI QIDQ5746339
Mohammad Mahmoody, Tal Malkin, Dana Dachman-Soled
Publication date: 18 February 2014
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_10
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (17)
A lower bound for adaptively-secure collective coin flipping protocols ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Limits on the usefulness of random oracles ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ An optimally fair coin toss ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Estimating gaps in martingales and applications to coin-tossing: constructions and hardness ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ On the complexity of fair coin flipping ⋮ On the complexity of fair coin flipping ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
