Paper 2016/048

Better Preprocessing for Secure Multiparty Computation

Carsten Baum, Ivan Damgård, Tomas Toft, and Rasmus Zakarias

Abstract

We present techniques and protocols for the preprocessing of secure multiparty computation (MPC), focusing on the so-called SPDZ MPC scheme SPDZ and its derivatives. These MPC schemes consist of a so-called preprocessing or offline phase where correlated randomness is generated that is independent of the inputs and the evaluated function, and an online phase where such correlated randomness is consumed to securely and efficiently evaluate circuits. In the recent years, it has been shown that such protocols turn out to be very efficient in practice. While much research has been conducted towards optimizing the online phase of the MPC protocols, there seems to have been less focus on the offline phase of such protocols. With this work, we want to close this gap and give a toolbox of techniques that aim at optimizing the preprocessing. We support both instantiations over small fields and large rings using somewhat homomorphic encryption and the Paillier cryptosystem, respectively. In the case of small fields, we show how the preprocessing overhead can basically be made independent of the field characteristic and present a more efficient (amortized) zero-knowledge proof of plaintext knowledge. In the case of large rings, we present a protocol based on the Paillier cryptosystem which has a lower message complexity than previous protocols and employs more efficient zero-knowledge proofs that, to the best of our knowledge, were not presented in previous work.

Note: Revised full version of the article with some additional material.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. MAJOR revision.14th International Conference on Applied Cryptography and Network Security (ACNS 2016)
DOI
10.1007/978-3-319-39555-5_18
Keywords
Efficient Multiparty ComputationPreprocessingHomomorphic EncryptionPaillier Encryption
Contact author(s)
cbaum @ cs au dk
History
2016-09-26: revised
2016-01-19: received
See all versions
Short URL
https://ia.cr/2016/048
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/048,
      author = {Carsten Baum and Ivan Damgård and Tomas Toft and Rasmus Zakarias},
      title = {Better Preprocessing for Secure Multiparty Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2016/048},
      year = {2016},
      doi = {10.1007/978-3-319-39555-5_18},
      note = {\url{https://eprint.iacr.org/2016/048}},
      url = {https://eprint.iacr.org/2016/048}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.