Paper 2019/153
Overdrive2k: Efficient Secure MPC over from Somewhat Homomorphic Encryption
Emmanuela Orsini, Nigel P. Smart, and Frederik Vercauteren
Abstract
Recently, Cramer et al. (CRYPTO 2018) presented a protocol, SPDZ2k, for actively secure multiparty computation for dishonest majority in the pre-processing model over the ring
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. CT-RSA 2020
- Contact author(s)
-
emmanuela orsini @ kuleuven be
nigel smart @ kuleuven be
frederik vercauteren @ kuleuven be - History
- 2019-11-23: last of 3 revisions
- 2019-02-20: received
- See all versions
- Short URL
- https://ia.cr/2019/153
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/153, author = {Emmanuela Orsini and Nigel P. Smart and Frederik Vercauteren}, title = {Overdrive2k: Efficient Secure {MPC} over $Z_{2^k}$ from Somewhat Homomorphic Encryption}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/153}, year = {2019}, url = {https://eprint.iacr.org/2019/153} }