Lecture 4 -general Secure Two Party and Multi Party Computation
نویسندگان
چکیده
In this lecture we will discuss secure two party and multi party computation. Assume we have m parties. Each party Pi holds a private value xi, and all parties want to compute some agreed upon function f (x2, x2..., xm). We will discuss and sketch the security requirements from such a computation and what difficulties arise from those requirements. We will present a protocol, but will not prove its correctness. ( A full proof can be found in Foundation of Cryptography Volume II Basic Applications ).
منابع مشابه
The Exact Round Complexity of Secure Computation
We revisit the exact round complexity of secure computation in the multi-party and twoparty settings. For the special case of two-parties without a simultaneous message exchange channel, this question has been extensively studied and resolved. In particular, Katz and Ostrovsky (CRYPTO ’04) proved that five rounds are necessary and sufficient for securely realizing every two-party functionality ...
متن کاملEfficient Three-Party Computation from Cut-and-Choose
With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols—in particular, the cut-and-choose approach—can be adapted to the multi-party setting. In this work we explore the possibility of using cut-and-choose for practical...
متن کاملSecure Multi-Party Computation from any Linear Secret Sharing Scheme
We present a general treatment of non-cryptographic (i.e. information-theoretically secure) multi-party computation, based on underlying linear secret sharing scheme. This general approach gives pure linear-algebra conditions on the linear mappings describing the scheme. The approach establishing the minimal conditions for security, can lead to design of more efficient Multi-Party Computation (...
متن کاملPreface to Special Issue on General Secure Multi-Party Computation
More than a decade has passed since general results concerning secure two-party and multi-party computations were rst announced in 15, 24, 16] (see details in 14]). In a nutshell, assuming the existence of trapdoor permutations, these results assert that one can construct protocols for securely computing any desirable multi-party functionality. These results either require a majority of honest ...
متن کاملEfficient Two Party and Multi Party Computation Against Covert Adversaries
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 computation protocols which are efficient enough to be usable in practice. Aumann and Lindell presented an efficient two party computation protocol secure against covert adversaries. They were able to utilize cut and...
متن کامل