On the power of an honest majority in three-party computation without broadcast

DOI10.1007/s00145-023-09456-4zbMath1518.94037OpenAlexW3091442321MaRDI QIDQ6109073

Eran Omri, Tom Suad, Bar Alon, Ran Cohen

Publication date: 26 July 2023

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-023-09456-4

zbMATH Keywords

broadcastcoin flippingimpossibility resultmultiparty computationpoint-to-point communicationhonest majority

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimally fair coin toss
• Easy impossibility proofs for distributed consensus problems
• Fairness versus guaranteed output delivery in secure multiparty computation
• Characterization of secure multiparty computation without broadcast
• Minimal complete primitives for secure multi-party computation
• Security and composition of multiparty cryptographic protocols
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
• On the power of an honest majority in three-party computation without broadcast
• On fully secure MPC with solitary output
• Protocols for multiparty coin toss with a dishonest majority
• On Fair Exchange, Fair Coins and Fair Sampling
• On the Classification of Finite Boolean Functions up to Fairness
• An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
• Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
• Asynchronous consensus and broadcast protocols
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Coin flipping by telephone a protocol for solving impossible problems
• Optimistic fair exchange of digital signatures
• Fair Coin Flipping: Tighter Analysis and the Many-Party Case
• Foundations of Cryptography
• Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
• Detectable byzantine agreement secure against faulty majorities
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Towards Characterizing Complete Fairness in Secure Two-Party Computation
• On the complexity of fair coin flipping
• From fairness to full security in multiparty computation

This page was built for publication: On the power of an honest majority in three-party computation without broadcast