Minimal Complete Primitives for Secure Multi-Party Computation
نویسندگان
چکیده
منابع مشابه
Unconditionally Secure Multi-party Computation from Weak Primitives
Let us assume that old friends meet again, after a long time. Both have become millionaires since that last time they met would like to find out who has been more successful in making money. However, they don't want the other to find out how much they earn, they both only want to get to know one bit of information. This problem is an example of secure multi-party computation, which has been int...
متن کاملComplete Characterization of AdversariesTolerable in Secure Multi - Party Computation
The classical results in unconditional multi-party computation among a set of n players state that less than n=2 passive or less than n=3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n=2. Strictly generalizing these results we specify the set of potentially misbehaving players as an arbitrary set of subsets of the player set. We 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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2004
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-004-0150-y