We present techniques and protocols for the preprocessing of secure multiparty computation (MPC), focusing on the so-called SPDZ MPC scheme and its derivatives. These MPC schemes consist of a so-called preprocessing or offline phase, where correlated randomness is generated that is independent of the inputs and the evaluated function, and an online phase, where such correlated randomness is con...

An AMD circuit over a nite eld F is a randomized arithmetic circuit that o ers the best possible protection against additive attacks. That is, the e ect of every additive attack that may blindly add a (possibly di erent) element of F to every internal wire of the circuit can be simulated by an ideal attack that applies only to the inputs and outputs. Genkin et al. (STOC 2014, Crypto 2015) intro...

In secure multiparty computation, a set of mutually mistrusting players engage in a protocol to compute an arbitrary, publicly known polynomial-sized function of the party’s private inputs, in a way that does not reveal (to an adversary controlling some of the players) any knowledge about the remaining inputs, beyond what can be deduced from the obtained output(s). Since its introduction by Yao...

We study the problem of secure two-party and multiparty computation (MPC) in a setting where a cheating polynomial-time adversary can corrupt an arbitrary subset of parties and, in addition, learn arbitrary auxiliary information on the entire states of all honest parties (including their inputs and random coins), in an adaptive manner, throughout the protocol execution. We formalize a definitio...

It seems to be a generally acknowledged fact that you should never trust a computer and that you should trust the person operating the computer even less. This in particular becomes a problem when the party that you do not trust is one which is separated from you and is one on which you depend, e.g. because that party is the holder of some data or some capability that you need in order to opera...

With the evolution of the Internet, collaborative filtering techniques are becoming increasingly popular in E-commerce recommender systems. Such techniques recommend items to users employing similar users' preference data. People use recommender systems to cope with information overload. Although collaborative filtering systems are widely used by E-commerce sites, they fail to protect users' pr...

We present oblivious implementations of several data structures for secure multiparty computation (MPC) such as arrays, dictionaries, and priority queues. The resulting oblivious data structures have only polylogarithmic overhead compared with their classical counterparts. To achieve this, we give secure multiparty protocols for the ORAM of Shi et al. (Asiacrypt ‘11) and the Path ORAM scheme of...