We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...