Complete Fairness in Multi-party Computation without an Honest Majority

DOI10.1007/978-3-642-00457-5_2zbMath1213.94104OpenAlexW2154537455MaRDI QIDQ3611756

S. Dov Gordon, Jonathan N. Katz

Publication date: 3 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_2

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ On fully secure MPC with solitary output ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Fully-secure MPC with minimal trust ⋮ Partial fairness in secure two-party computation ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Characterization of secure multiparty computation without broadcast ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ From fairness to full security in multiparty computation ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ On Complete Primitives for Fairness ⋮ MPC with friends and foes

This page was built for publication: Complete Fairness in Multi-party Computation without an Honest Majority