Cryptology ePrint Archive: Report 2016/505

MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer

Marcel Keller and Emmanuela Orsini and Peter Scholl

Abstract: We consider the task of secure multi-party computation of arithmetic circuits over a finite field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be expressed easily and efficiently. In the strongest setting of malicious security with a dishonest majority where any number of parties may deviate arbitrarily from the protocol most existing protocols require expensive public-key cryptography for each multiplication in the preprocessing stage of the protocol, which leads to a high total cost.

We present a new protocol that overcomes this limitation by using oblivious transfer to perform secure multiplications in general finite fields with reduced communication and computation. Our protocol is based on an arithmetic view of oblivious transfer, with careful consistency checks and other techniques to obtain malicious security at a cost of less than 6 times that of semi-honest security. We describe a highly optimized implementation together with experimental results for up to five parties. By making extensive use of parallelism and SSE instructions, we improve upon previous runtimes for MPC over arithmetic circuits by more than 200 times.

Category / Keywords: cryptographic protocols / Multi-party computation, oblivious transfer

Original Publication (with major differences): ACM CCS 2016

Date: received 23 May 2016, last revised 14 Sep 2016

Contact author: M Keller at bristol ac uk, Emmanuela Orsini@bristol ac uk, Peter Scholl@bristol ac uk

Available format(s): PDF | BibTeX Citation

Note: Full version

Version: 20160914:152228 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]