International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits

Authors:
Daniel Escudero , Aarhus University, Denmark
Satrajit Ghosh , Aarhus University, Denmark
Marcel Keller , CSIRO's Data61
Rahul Rachuri , Aarhus University, Denmark
Peter Scholl , Aarhus University, Denmark
Download:
DOI: http://dx.doi.org/10.1007/978-3-030-56880-1_29 (login may be required)
Search ePrint
Search Google
Conference: CRYPTO 2020
Abstract: This work introduces novel techniques to improve the translation between arithmetic and binary data types in multi-party computation. To this end, we introduce a new approach to performing these conversions, using what we call \emph{extended doubly-authenticated bits} (edaBits), which correspond to shared integers in the arithmetic domain whose bit decomposition is shared in the binary domain. These can be used to considerably increase the efficiency of non-linear operations such as truncation, secure comparison and bit-decomposition. Our eDaBits are similar to the \emph{daBits} technique introduced by Rotaru et al.~(Indocrypt 2019). However, our main observations are that (1) applications that benefit from daBits can also benefit from edaBits in the same way, and (2) we can generate edaBits directly in a much more efficeint way than computing them directly from a set of DaBits. Technically, the second contribution is much more challenging, and involves a novel cut and choose technique that may be of independent interest, and requires taking advantage of natural tamper-resilient properties of binary circuits that occur in our construction to obtain the best level of efficiency. Finally, we show how our eDaBits can be applied to efficiently implement various non-linear protocols of interest, and we thoroughly analyze their correctness for both signed and unsigned integers. The results of this work can be applied to any corruption threshold, although they seem best suited to dishonest majority protocols such as SPDZ. We implement and benchmark our constructions, and experimentally verify that our technique yield a substantial increase in effiency. Our eDaBits save in communication by a factor that lies between $2$ and $170$ for secure comparisons with respect to a purely arithmetic approach, and between $2$ and $60$ with respect to using daBits. Improvements in throughput per second are more subdued but still as high as a factor of $47$. We also apply our novel machinery to the tasks of biometric matching and convolutional neural networks, obtaining a noticeable improvement as well.
Video from CRYPTO 2020
BibTeX
@inproceedings{crypto-2020-30455,
  title={Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits},
  publisher={Springer-Verlag},
  doi={http://dx.doi.org/10.1007/978-3-030-56880-1_29},
  author={Daniel Escudero and Satrajit Ghosh and Marcel Keller and Rahul Rachuri and Peter Scholl},
  year=2020
}