Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
From MaRDI portal
Publication:5261630
DOI10.1007/978-3-662-46494-6_10zbMath1354.94020OpenAlexW101616332MaRDI QIDQ5261630
Nikolaos Makriyannis, Gilad Asharov, Eran Omri, Amos Beimel
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_10
Related Items (17)
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 ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ 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 ⋮ Fully-secure MPC with minimal trust ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ 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 ⋮ MPC with friends and foes
This page was built for publication: Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
