Overdrive2k: efficient secure MPC over Z₂^k from somewhat homomorphic encryption

DOI10.1007/978-3-030-40186-3_12MaRDI QIDQ785020zbMATH OpenOpenAlexFDO

Authors Emmanuela Orsini, Frederik Vercauteren, N. P. Smart

Publication date 5 August 2020

Full work available at URL https://doi.org/10.1007/978-3-030-40186-3_12

zbMATH Keywords

actively secure multiparty computationMASCOT protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
• Overdrive: making SPDZ great again
• Multiparty Computation from Somewhat Homomorphic Encryption

Cited in

(20)

• Overdrive: making SPDZ great again
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• 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
• 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
• Efficient, actively secure MPC with a dishonest majority: a survey
• Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
• 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
• Lightweight asynchronous verifiable secret sharing with optimal resilience
• Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
• Dishonest majority multiparty computation over matrix rings
• Generation of authenticated secret-shared scaled unit vectors for beaver triples
• Correction to: ``Actively secure setup for SPDZ
• Pseudorandom correlation functions from Ring-LWR
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ

This page was built for publication: Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q785020)