Characterization of Secure Multiparty Computation Without Broadcast
From MaRDI portal
Publication:2796144
DOI10.1007/978-3-662-49096-9_25zbMath1348.94039arXiv2105.00732OpenAlexW2277801718MaRDI QIDQ2796144
Iftach Haitner, Ran Cohen, Eran Omri, Lior Rotem
Publication date: 23 March 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00732
fairnessbroadcastcoin flippingimpossibility resultmultiparty computationpoint-to-point communication
Related Items (8)
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Characterization of secure multiparty computation without broadcast ⋮ On the exact round complexity of secure three-party computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
Cites Work
- Unnamed Item
- Unnamed Item
- Easy impossibility proofs for distributed consensus problems
- Characterization of secure multiparty computation without broadcast
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- Authenticated Algorithms for Byzantine Agreement
- Protocols for Multiparty Coin Toss with Dishonest Majority
- An Optimally Fair Coin Toss
- Complete Fairness in Multi-party Computation without an Honest Majority
- The Weak Byzantine Generals Problem
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Foundations of Cryptography
- Detectable byzantine agreement secure against faulty majorities
This page was built for publication: Characterization of Secure Multiparty Computation Without Broadcast
