We present a secure multiparty computation (MPC) protocol based on garbled circuits which is both actively secure and supports the free-XOR technique, and which has communication complexity $O(n)$ per party. This improves on a protocol of Ben-Efraim, …
At CRYPTO 2018, Cascudo et al. introduced Reverse Multiplication Friendly Embeddings (RMFEs). These are a mechanism to compute $\delta$ parallel evaluations of the same arithmetic circuit over a field $F_q$ at the cost of a single evaluation of that …
Recent years have seen a tremendous growth in the interest in secure multiparty computation (MPC) and its applications. While much progress has been made concerning its efficiency, many current, state-of-the-art protocols are vulnerable to Denial of …
In this work we develop a new theory for concretely efficient, large-scale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which leads to protocols that scale badly with the number …
We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. Motivated by the fact that within the dishonest majority setting the efficiency of most practical protocols does …
In this work, we present two new actively secure, constant round multi-party computation (MPC)protocols with security against all-but-one corruptions. Our protocols both start with an actively secure MPC protocol, which may have linear round …
We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party *TinyTable* protocol of Damgard et al. (ePrint 2016). Like TinyTable, an attractive feature of our protocol is a very …
We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. Our protocol sits philosophically between Gentrys Fully Homomorphic Encryption based protocol and the SPDZ-BMR protocol of Lindell et …