Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
From MaRDI portal
Publication:785020
DOI10.1007/978-3-030-40186-3_12zbMath1457.94168OpenAlexW3005589384MaRDI QIDQ785020
Emmanuela Orsini, Frederik Vercauteren, Nigel P. Smart
Publication date: 5 August 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-40186-3_12
Related Items (11)
Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Field instruction multiple data ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Actively secure setup for SPDZ
This page was built for publication: Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
