Span Programs and General Secure Multi-Party Computation
نویسندگان
چکیده
منابع مشابه
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...
متن کاملUnconditionally Secure Multi-Party Computation
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...
متن کاملHeterogeneous Secure Multi-Party Computation
The increased processing power and storage capacity of inhome and mobile computing devices has motivated their inclusion in distributed and cloud computing systems. The resulting diverse environment creates a strong requirement for secure computations, which can be realised by Secure Multi-Party Computation (MPC). However, MPC most commonly assumes that parties performing the secure computation...
متن کاملEfficient Secure Multi-party Computation
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. The most efficient unconditionally secure protocols among n players, tolerating cheating by up to t < n/3 of them, require communicating O(n6) field elements for each multiplication of two elements, even if only one pla...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1997
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v4i28.18954