Coin flipping of any constant bias implies one-way functions
DOI10.1145/2591796.2591845zbMATH Open1315.94055OpenAlexW2028166021MaRDI QIDQ5259574FDOQ5259574
Itay Berman, Iftach Haitner, Aris Tentes
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591845
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Theory of Cryptography
- The geometry of differential privacy: the small database and approximate cases
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the complexity of differentially private data release
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Characterizing the sample complexity of private learners
- Faster Algorithms for Privately Releasing Marginals
- Faster private release of marginals on small databases
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately releasing conjunctions and the statistical query barrier
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (5)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- An optimally fair coin toss
- Coin Flipping with Constant Bias Implies One-Way Functions
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
Uses Software
Recommendations
- Coin Flipping with Constant Bias Implies One-Way Functions 👍 👎
- Coin Flipping with Constant Bias Implies One-Way Functions 👍 👎
- Coin Flipping of Any Constant Bias Implies One-Way Functions 👍 👎
- Black-box use of one-way functions is useless for optimal fair coin-tossing 👍 👎
- From biased coin to any discrete distribution 👍 👎
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? 👍 👎
- Title not available (Why is that?) 👍 👎
- Von Neumann's Biased Coin Revisited 👍 👎
- An Infinitely-Often One-Way Function Based on an Average-Case Assumption 👍 👎
- An infinitely-often one-way function based on an average-case assumption 👍 👎
This page was built for publication: Coin flipping of any constant bias implies one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259574)
