Paper 2024/837
Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions
Abstract
We revisit the question of the overhead to achieve full security (i.e., guaranteed output delivery) in secure multiparty computation (MPC). Recent works have closed the gap between full security and semi-honest security, by introducing protocols where the parties first compute the circuit using a semi-honest protocol and then run a verification step with sublinear communication in the circuit size. However, in these works the number of interaction rounds in the verification step is also sublinear in the circuit's size. Unlike communication, the round complexity of the semi-honest execution typically grows with the circuit's depth and not its size. Hence, for large but shallow circuits, this additional number of rounds incurs a significant overhead. Motivated by this gap, we make the following contributions:
1. We present a new MPC framework to obtain full security, compatible with effectively any ring, that has an additive communication overhead of only
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in CRYPTO 2024
- Keywords
- FLIOPMPCHonest MajorityRings
- Contact author(s)
-
anderspkd @ fastmail com
daniel escudero @ protonmail com
ariel nof @ biu ac il - History
- 2024-05-31: approved
- 2024-05-28: received
- See all versions
- Short URL
- https://ia.cr/2024/837
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/837, author = {Anders Dalskov and Daniel Escudero and Ariel Nof}, title = {Fully Secure {MPC} and zk-{FLIOP} Over Rings: New Constructions, Improvements and Extensions}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/837}, year = {2024}, url = {https://eprint.iacr.org/2024/837} }