Towards Characterizing Complete Fairness in Secure Two-Party Computation
From MaRDI portal
Publication:5746342
DOI10.1007/978-3-642-54242-8_13zbMath1326.94070OpenAlexW2107507022MaRDI QIDQ5746342
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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Related Items (20)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ 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 ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ 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? ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: Towards Characterizing Complete Fairness in Secure Two-Party Computation
