Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

Peter Sebastian Nordholt; Meilof Veeningen

Paper 2018/474

Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

Peter Sebastian Nordholt and Meilof Veeningen

Abstract

In this paper, we present two new and very communication-efficient protocols for maliciously secure multi-party computation over fields in the honest-majority setting with abort. Our first protocol improves a recent protocol by Lindell and Nof. Using the so far overlooked tool of batchwise multiplication verification, we speed up their technique for checking correctness of multiplications (with some other improvements), reducing communication by 2x to 7x. In particular, in the 3PC setting, each party sends only two field elements per multiplication. We also show how to achieve fairness, which Lindell and Nof left as an open problem. Our second protocol again applies batchwise multiplication verification, this time to perform 3PC by letting two parties perform the SPDZ protocol using triples generated by a third party and verified batchwise. In this protocol, each party sends only 4/3 field elements during the online phase and 5/3 field elements during the preprocessing phase.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Major revision. Proceedings ACNS 2018
Keywords: multi-party computation
Contact author(s): meilof @ gmail com
History: 2018-05-23: revised; 2018-05-23: received; See all versions
Short URL: https://ia.cr/2018/474
License: CC BY

BibTeX

@misc{cryptoeprint:2018/474,
      author = {Peter Sebastian Nordholt and Meilof Veeningen},
      title = {Minimising Communication in Honest-Majority {MPC} by Batchwise Multiplication Verification},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/474},
      year = {2018},
      url = {https://eprint.iacr.org/2018/474}
}