1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds

DOI10.1007/978-3-642-22792-9_16zbMath1287.94051arXiv1011.5567OpenAlexW1602159460MaRDI QIDQ5199197

Ilan Orlov, Amos Beimel, Eran Omri, Yehuda Lindell

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.5567

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ An optimally fair coin toss ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ 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 ⋮ On the exact round complexity of best-of-both-worlds multi-party 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 ⋮ From fairness to full security in multiparty computation ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds