Cryptology ePrint Archive: Report 2020/1330

Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security

Anders Dalskov and Daniel Escudero and Marcel Keller

Abstract: In this work we introduce a novel four-party honest-majority MPC protocol with active security that achieves comparable efficiency to equivalent protocols in the same setting, while having a much simpler design and not relying on function-dependent preprocessing. Our initial protocol satisfies security with abort, but we present some extensions to achieve guaranteed output delivery. Unlike previous works, we do not achieve this by delegating the computation to one single party that is identified to be honest, which is likely to hinder the adoption of these technologies as it centralizes sensitive data. Instead, our novel approach guarantees termination of the protocol while ensuring that no single party (honest or corrupt) learns anything beyond the output.

We implement our four-party protocol with abort in the MP-SPDZ framework for multiparty computation and benchmark multiple applications like MNIST classification training and ImageNet inference. Our results show that our four-party protocol performs similarly to an efficient honest-majority three-party protocol that only provides semi-honest/passive security, which suggest that adding a fourth party can be an effective method to achieve active security without harming performance.

Category / Keywords: cryptographic protocols / Multiparty Computation, Machine Learning, Implementation

Date: received 23 Oct 2020, last revised 23 Oct 2020

Contact author: escudero at cs au dk, Marcel Keller@data61 csiro au, mks keller@gmail com, anderspkd@fastmail com

Available format(s): PDF | BibTeX Citation

Version: 20201023:085611 (All versions of this report)

Short URL: ia.cr/2020/1330


[ Cryptology ePrint archive ]