An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
From MaRDI portal
Publication:2968163
DOI10.1137/15M1009147zbMath1366.94499arXiv2105.00850OpenAlexW1998576364MaRDI QIDQ2968163
Publication date: 10 March 2017
Published in: SIAM Journal on Computing, Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00850
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (20)
A lower bound for adaptively-secure collective coin flipping protocols ⋮ Computational hardness of optimal fair computation: beyond Minicrypt ⋮ 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 ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Characterization of secure multiparty computation without broadcast ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ On the complexity of fair coin flipping ⋮ On the complexity of fair coin flipping ⋮ From fairness to full security in multiparty computation ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- A new protocol and lower bounds for quantum coin flipping
- Security and composition of multiparty cryptographic protocols
- Efficient algorithms for privately releasing marginals via convex relaxations
- Characterization of Secure Multiparty Computation Without Broadcast
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- 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
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Quantum bit escrow
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Trapdoors for hard lattices and new cryptographic constructions
- Partial Fairness in Secure Two-Party Computation
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- Protocols for Multiparty Coin Toss with Dishonest Majority
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- An Optimally Fair Coin Toss
- A Robust Noncryptographic Protocol for Collective Coin Flipping
- Coin-Flipping Games Immune against Linear-Sized Coalitions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Collusion-secure fingerprinting for digital data
- Foundations of Cryptography
- On the complexity of differentially private data release
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
- Coin flipping of any constant bias implies one-way functions
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Advances in Cryptology – CRYPTO 2004
- Probability Inequalities for Sums of Bounded Random Variables
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Complete Fairness in Secure Two-Party Computation
- Coin Flipping with Constant Bias Implies One-Way Functions
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Automata, Languages and Programming
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
