Coin flipping of any constant bias implies one-way functions
DOI10.1145/2591796.2591845zbMATH Open1315.94055OpenAlexW2028166021MaRDI QIDQ5259574FDOQ5259574
Authors: 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
Recommendations
- Coin flipping with constant bias implies one-way functions
- Coin Flipping with Constant Bias Implies One-Way Functions
- Coin flipping of \textit{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?
- Biasing Boolean functions and collective coin-flipping protocols over arbitrary product distributions
- 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
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Theory of Cryptography
- 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, efficient algorithms and hardness results
- 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
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (6)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Coin flipping with constant bias implies one-way functions
- Coin flipping of \textit{any} constant bias implies one-way functions
- 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
Uses Software
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)
