Secure Multi-party Computation: A Survey
A Comparison of Secure Multi-party Computation Protocols and other Techniques for Computing on Encrypted Data
P. Gomes Moreira (TU Delft - Electrical Engineering, Mathematics and Computer Science)
E.A. Markatou – Mentor (TU Delft - Cyber Security)
Tim Coopmans – Graduation committee member (TU Delft - QCD/Coopmans Group)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Secure multi-party computation (MPC) allows parties to compute on their secret inputs, without revealing them to each other. As an area of theoretical interest, many MPC protocol have been developed in the last four decades. They each present different characteristics and are classified under distinct categories depending on their generality, security assumptions, and functionality. More recently, MPC has also become an area of practical interest due to optimizations in performance of the protocols. In this paper, we compare MPC protocols and other techniques for computing on encrypted data, considering how their properties affect security, efficiency, usability, and functionality. We show that there is a trade-off between security and efficiency when different adversarial models are used, as well as a trade-off between efficiency and flexibility in specialized protocols.