As a powerful tool in solving privacy preserving cooperative problems, secure multiparty computation is more and more popular in electronic bidding, anonymous voting, and online auction. Privacy preserving sequencing problem which is an essential link is regarded as the core issue in these applications. However, due to the difficulties of solvingmultiparty privacy preserving sequencing problem,...

European Union funded research project Usable and Efficient Secure Multiparty Computation (UaESMC) deliverable D1.1 [11] lists various application scenarios where secret sharing based secure multiparty computation (SMC) can be used. Inspired by their results, this work tries to add one more level of abstraction and compare different secure evaluation techniques from the point of applicability i...

The popularity of internet as a communication medium whether for personal or business requires anonymous communication in various ways. Businesses also have legitimate reasons to make communication anonymous and avoid the consequences of identity revelation. The problem of sharing privately held data so that the individuals who are the subjects of the data cannot be identified has been research...

Isolated Execution Environments (IEE) offered by novel commodity hardware such as Intel’s SGX deployed in Skylake processors permit executing software in a protected environment that shields it from a malicious operating system; it also permits a remote user to obtain strong interactive attestation guarantees on both the code running in an IEE and its input/output behaviour. In this paper we sh...

In this note, we report on the first large-scale and practical application of multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used.

Secure multiparty computation (MPC) permits a collection of parties to compute a collaborative result without any of the parties or compute servers gaining any knowledge about the inputs provided by other parties, except what can be determined from the output of the computation. In the form of MPC known as linear (or additive) sharing, computation proceeds on data that appears entirely random. ...

We introduce and study the notion of non-interactive secure multiparty computation (NIMPC). An NIMPC protocol for a function f(x1, . . . , xn) is specified by a joint probability distribution R = (R1, . . . , Rn) and local encoding functions Enci(xi, ri), 1 ≤ i ≤ n. Given correlated randomness (r1, . . . , rn) ∈R R, each party Pi, using its input xi and its randomness ri, computes the message m...