Minimising communication in honest-majority MPC by batchwise multiplication verification
From MaRDI portal
Publication:1656048
DOI10.1007/978-3-319-93387-0_17zbMath1440.94071OpenAlexW2805909171MaRDI QIDQ1656048
Peter Sebastian Nordholt, Meilof Veeningen
Publication date: 10 August 2018
Full work available at URL: https://eprint.iacr.org/2018/474.pdf
Related Items (13)
Fluid MPC: secure multiparty computation with dynamic participants ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Honest majority MPC with abort with minimal online communication ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ 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 ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ 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
This page was built for publication: Minimising communication in honest-majority MPC by batchwise multiplication verification
