Characterization of secure multiparty computation without broadcast

DOI10.1007/s00145-017-9264-xzbMath1444.94056OpenAlexW3157356141MaRDI QIDQ1753172

Iftach Haitner, Lior Rotem, Ran Cohen, Eran Omri

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

zbMATH Keywords

fairnessbroadcastcoin flippingimpossibility resultmultiparty computationpoint-to-point communication

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Must the communication graph of MPC protocols be an expander? ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ From fairness to full security in multiparty computation ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ Broadcast-optimal two-round MPC

Cites Work

• Unnamed Item
• Easy impossibility proofs for distributed consensus problems
• Secure multi-party computation without agreement
• Protocols for multiparty coin toss with a dishonest majority
• 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
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• 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
• Fair Coin Flipping: Tighter Analysis and the Many-Party Case
• Foundations of Cryptography
• Unconditional Byzantine agreement for any number of faulty processors
• Detectable byzantine agreement secure against faulty majorities
• From fairness to full security in multiparty computation