Paper 2023/855 Original: eprint.iacr.org/2023/855 ↗
$\mathsf{Mercury}$: Constant-Round Protocols for Multi-Party Computation with Rationals
Abstract
Most protocols for secure multi-party computation (MPC) work over fields or rings, which means that encoding techniques are needed to map rational-valued data into the algebraic structure being used. Leveraging an encoding technique introduced in recent work of Harmon et al. that is compatible with any MPC protocol over a prime-order field, we present Mercury - a family of protocols for addition, multiplication, subtraction, and division of rational numbers. Notably, the output of our division protocol is exact (i.e., it does not use iterative methods). Our protocols offer improvements in both round complexity and communication complexity when compared with prior art, and are secure for a dishonest minority of semi-honest parties.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-02-28: last updated
- 2023-06-06: published
- Short URL
- https://ia.cr/2023/855
- License
- https://creativecommons.org/licenses/by-nc/4.0/
BibTeX
@misc{cryptoeprint:2023/855,
author = {Luke Harmon and Gaetan Delavignette},
title = {$\mathsf{Mercury}$: Constant-Round Protocols for Multi-Party Computation with Rationals},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/855},
year = {2023},
url = {https://eprint.iacr.org/2023/855}
}