Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

DOI10.1007/978-3-642-32009-5_39zbMath1296.94082OpenAlexW1576843907MaRDI QIDQ2914294

Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (28)

ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits ⋮ Honest majority MPC with abort with minimal online communication ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Prio+: privacy preserving aggregate statistics via Boolean shares ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ On the exact round complexity of secure three-party computation ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Proactive Secret Sharing with a Dishonest Majority ⋮ Network Oblivious Transfer ⋮ Secure Protocol Transformations ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings

This page was built for publication: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority