Paper 2020/1556
Honest Majority MPC with Abort with Minimal Online Communication
Daniel Escudero and Anders Dalskov
Abstract
In this work we focus on improving the communication complexity of the \emph{online phase} of honest majority MPC protocols.
To this end, we present a general and simple method to compile arbitrary secret-sharing-based passively secure protocols defined over an arbitrary ring that are secure up to additive attacks in a malicious setting, to actively secure protocols with abort.
The resulting protocol has a total communication complexity in the online phase of
Note: Updated version after Latincrypt reviews
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. Latincrypt 2021
- Keywords
- secure multiparty computationprotocolcommunication efficienthonest-majority
- Contact author(s)
-
daniel escudero @ protonmail com
anderspkd @ fastmail com - History
- 2021-10-05: revised
- 2020-12-13: received
- See all versions
- Short URL
- https://ia.cr/2020/1556
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1556, author = {Daniel Escudero and Anders Dalskov}, title = {Honest Majority {MPC} with Abort with Minimal Online Communication}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1556}, year = {2020}, url = {https://eprint.iacr.org/2020/1556} }