Efficiently Compiling Secure Computation Protocols From Passive to Active Security: Beyond Arithmetic Circuits

Authors: Marina Blanton (University at Buffalo), Dennis Murphy (University at Buffalo), Chen Yuan (Meta Platform, Inc.)

Volume: 2024
Issue: 1
Pages: 74–97
DOI: https://doi.org/10.56553/popets-2024-0006

Artifact: Reproduced

Download PDF

Abstract: This work studies compilation of honest-majority semi-honest secure multi-party protocols secure up to additive attacks to maliciously secure computation with abort. Prior work concentrated on arithmetic circuits composed of addition and multiplication gates, while many practical protocols rely on additional types of elementary operations or gates to achieve good performance. In this work we revisit the notion of security up to additive attacks in the presence of additional gates such as random element generation and opening. This requires re-evaluation of functions that can be securely evaluated, extending the notion of protocols secure up to additive attacks, and re-visiting the notion of delayed verification that points to weaknesses in its prior use and designing a mitigation strategy. We transform the computation using dual execution to achieve security in the malicious model with abort and experimentally evaluate the difference in performance of semi-honest and malicious protocols to demonstrate the low cost.

Keywords: secure multi-party computation, secret sharing, active security, extended set of gates

Copyright in PoPETs articles are held by their authors. This article is published under a Creative Commons Attribution 4.0 license.