International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic

Authors:
Mariya Georgieva Belorgey
Sergiu Carpov
Kevin Deforth
Dimitar Jetchev
Abson Sae-Tang
Marius Vuille
Nicolas Gama
Jon Katz
Iraklis Leontiadis
Mohsen Mohammadi
Download:
DOI: 10.1007/s00145-023-09464-4
Search ePrint
Search Google
Abstract: We propose a novel framework, $$\texttt{Manticore}$$ Manticore , for multiparty computations, with full threshold and semi-honest security model, supporting a combination of real number arithmetic (arithmetic shares), Boolean arithmetic (Boolean shares) and garbled circuits (Yao shares). In contrast to prior work (Mohassel and Zhang, in 2017 IEEE symposium on security and privacy (SP), 2017; Mohassel and Rindal, in Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, 2018), $$\texttt{Manticore}$$ Manticore mitigates overflows, which is of paramount importance for machine learning applications, without compromising efficiency or security. Compared to other overflow-free recent techniques such as MP-SPDZ (Escudero et al., in 40th annual international cryptology conference, CRYPTO. Lecture notes in computer science, 2020) that convert arithmetic to Boolean shares, $$\texttt{Manticore}$$ Manticore uses an efficient modular lifting/truncation method that allows for scalable high numerical precision computations with optimal numerical windows and hence, highly efficient online phases. We adapt basic MPC operations such as real-valued polynomial evaluation, division, logarithms, exponentials, Fourier series evaluations and oblivious comparisons to $$\texttt{Manticore}$$ Manticore by employing our modular lift in combination with existing efficient conversions between arithmetic, Boolean and Yao shares. We also describe a highly scalable computations of logistic regression models with real-world training data sizes and high numerical precision through PCA and blockwise variants (for memory and runtime optimizations) based on second-order optimization techniques. On a dataset of 50 M samples and 50 features distributed among two players, the online phase completes in 14.5 h with at least 10 decimal digits of precision compared to plaintext training. The setup phase of $$\texttt{Manticore}$$ Manticore is supported in both the trusted dealer and the interactive models allowing for tradeoffs between efficiency and stronger security. The highly efficient online phase makes the framework particularly suitable for MPC applications where the output of the setup phase is part of the input of the protocol (such as MPC-in-the-head or Prio ).
BibTeX
@article{jofc-2023-33320,
  title={Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic},
  journal={Journal of Cryptology},
  publisher={Springer},
  volume={36},
  doi={10.1007/s00145-023-09464-4},
  author={Mariya Georgieva Belorgey and Sergiu Carpov and Kevin Deforth and Dimitar Jetchev and Abson Sae-Tang and Marius Vuille and Nicolas Gama and Jon Katz and Iraklis Leontiadis and Mohsen Mohammadi},
  year=2023
}