Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …

Abstract Secure Multi-Party Computation (SMPC) is a generic cryptographic primitive that
enables distributed parties to jointly compute an arbitrary functionality without revealing their …

This paper presents DeepSecure, the an scalable and provably secure Deep Learning (DL)
framework that is built upon automated design, efficient logic synthesis, and optimization …

Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

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 …

When two or more parties need to compute a common result while safeguarding their
sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled …

Abstract SPDZ (pronounced “Speedz”) is the nickname of the MPC protocol of Damgård et
al. from Crypto 2012. In this paper we both resolve a number of open problems with SPDZ; …

Secure two-party computation enables two parties to evaluate a function cooperatively
without revealing to either party anything beyond the function's output. The garbled-circuit …

We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-
garbling. We provide such schemes making only one AES call per garbled-gate evaluation …

We propose a new approach to practical two-party computation secure against an active
adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT …