Characterization of secure multiparty computation without broadcast
From MaRDI portal
Publication:1753172
DOI10.1007/S00145-017-9264-XzbMATH Open1444.94056OpenAlexW3157356141MaRDI QIDQ1753172FDOQ1753172
Authors: Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem 
Publication date: 28 May 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-017-9264-x
Recommendations
- Characterization of secure multiparty computation without broadcast
- An efficient approach for secure multi-party computation without authenticated channel
- Secure multi-party computation without agreement
- Secure multiparty computations without computers
- Non-interactive secure multiparty computation
- The broadcast message complexity of secure multiparty computation
- Secure multiparty computation without one-way functions
- An efficient construction of non-interactive secure multiparty computation
- Multiparty Computations in Non-private Environments
- An Efficient Framework for Unconditionally Secure Multiparty Computation
fairnessbroadcastcoin flippingmultiparty computationimpossibility resultpoint-to-point communication
Cites Work
- Foundations of Cryptography
- Authenticated Algorithms for Byzantine Agreement
- The Weak Byzantine Generals Problem
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimally Fair Coin Toss
- Complete Fairness in Multi-party Computation without an Honest Majority
- Easy impossibility proofs for distributed consensus problems
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Secure multi-party computation without agreement
- Detectable Byzantine agreement secure against faulty majorities
- Protocols for multiparty coin toss with a dishonest majority
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Fair coin flipping: tighter analysis and the many-party case
- Fairness versus guaranteed output delivery in secure multiparty computation
- Characterization of secure multiparty computation without broadcast
- Title not available (Why is that?)
Cited In (9)
- On the power of an honest majority in three-party computation without broadcast
- Broadcast-optimal two-round MPC
- A zero-one law for secure multi-party computation with ternary outputs
- On secure computation of solitary output functionalities with and without broadcast
- Title not available (Why is that?)
- Characterization of secure multiparty computation without broadcast
- Complete characterization of broadcast and pseudo-signatures from correlations
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Must the communication graph of MPC protocols be an expander?
This page was built for publication: Characterization of secure multiparty computation without broadcast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753172)
