Communication-efficient unconditional MPC with guaranteed output delivery
From MaRDI portal
Publication:2304979
DOI10.1007/978-3-030-26951-7_4zbMath1478.68093OpenAlexW2969199242MaRDI QIDQ2304979
Yifan Song, Yanyi Liu, Vipul Goyal
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_4
Related Items (17)
ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ 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 ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings ⋮ The price of active security in cryptographic protocols
This page was built for publication: Communication-efficient unconditional MPC with guaranteed output delivery
