Towards characterizing complete fairness in secure two-party computation

DOI10.1007/978-3-642-54242-8_13MaRDI QIDQ5746342zbMATH OpenOpenAlexFDO

Authors Gilad Asharov

Publication date 18 February 2014

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54242-8_13

zbMATH Keywords

complete fairnessfoundationsmalicious adversariessecure two-party computation

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Complete fairness in secure two-party computation
• Complete fairness in secure two-party computation
• On the classification of finite Boolean functions up to fairness
• Partial fairness in secure two-party computation

Cited in

(33)

• Secure two-party computation with fairness -- a necessary design principle
• Designing fully secure protocols for secure two-party computation of constant-domain functions
• Fairness versus guaranteed output delivery in secure multiparty computation
• Black-box use of one-way functions is useless for optimal fair coin-tossing
• Computational hardness of optimal fair computation: beyond Minicrypt
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• On fully secure MPC with solitary output
• Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
• \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
• On the classification of finite Boolean functions up to fairness
• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
• On complete primitives for fairness
• Complete fairness in secure two-party computation
• Partial fairness in secure two-party computation
• Complete Fairness in Multi-party Computation without an Honest Majority
• Partial fairness in secure two-party computation
• A full characterization of functions that imply fair coin tossing and ramifications to fairness
• Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
• Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
• Complete fairness in secure two-party computation
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• On perfectly secure 2PC in the OT-hybrid model
• On perfectly secure 2PC in the OT-hybrid model
• Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
• On the power of an honest majority in three-party computation without broadcast
• Synchronizable fair exchange
• On secure computation of solitary output functionalities with and without broadcast
• Three party secure computation with friends and foes
• Just how fair is an unreactive world?
• Complete characterization of fairness in secure two-party computation of Boolean functions
• Can Alice and Bob guarantee output to Carol?
• Fair coin flipping: tighter analysis and the many-party case
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols

This page was built for publication: Towards characterizing complete fairness in secure two-party computation

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