On secure computation of solitary output functionalities with and without broadcast

DOI10.1007/978-3-031-48618-0_4MaRDI QIDQ6582168zbMATH OpenFDO

Authors Bar Alon, Eran Omri

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48618-0_4

zbMATH Keywords

broadcastimpossibility resultpoint-to-point communicationsecure multiparty computationsolitary output

Mathematics Subject Classification ID

Network protocols (68M12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Communication theory (94A05) Cryptography (94A60)

Recommendations

• On fully secure MPC with solitary output
• Can Alice and Bob guarantee output to Carol?
• Characterization of secure multiparty computation without broadcast
• Characterization of secure multiparty computation without broadcast
• On the round complexity of fully secure solitary MPC with honest majority

Cites work

• A full characterization of functions that imply fair coin tossing and ramifications to fairness
• A minimal model for secure computation (extended abstract)
• Characterization of secure multiparty computation without broadcast
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Complete Fairness in Multi-party Computation without an Honest Majority
• Complete fairness in secure two-party computation
• Designing fully secure protocols for secure two-party computation of constant-domain functions
• Easy impossibility proofs for distributed consensus problems
• Fairness versus guaranteed output delivery in secure multiparty computation
• Minimal complete primitives for secure multi-party computation
• Non-interactive secure multiparty computation
• On fully secure MPC with solitary output
• On the classification of finite Boolean functions up to fairness
• On the power of an honest majority in three-party computation without broadcast
• Reaching Agreement in the Presence of Faults
• Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
• The Byzantine Generals Problem
• Towards characterizing complete fairness in secure two-party computation
• Uncovering algebraic structures in the MPC landscape

Cited in

(1)

• Can Alice and Bob guarantee output to Carol?

This page was built for publication: On secure computation of solitary output functionalities with and without broadcast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582168)