Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
Citations
114 citations
45 citations
Cites background or methods from "Round Efficient Unconditionally Sec..."
...There are also publications that develop private set intersection protocols in the information-theoretic setting [56, 59, 58, 60]....
[...]
...This solution is used in [60] to build a protocol that works when the adversary controls t < n/2 parties, in which case communication complexity becomesO(nm+n)....
[...]
28 citations
Cites background from "Round Efficient Unconditionally Sec..."
...In addition, relatively inefficient information theoretic solutions are presented in [33, 34])....
[...]
25 citations
22 citations
References
3,579 citations
"Round Efficient Unconditionally Sec..." refers background in this paper
...MPC is one of the most important and fundamental problems in secure distributed computing and has been studied extensively in different settings (see [19, 11, 5, 6, 18, 1, 12, 10, 2, 4, 3, 16] and their references)....
[...]
3,510 citations
"Round Efficient Unconditionally Sec..." refers background in this paper
...Secure Multiparty Computation (MPC): Secure multiparty computation (MPC) [19] allows a set of n parties P = {P1, ....
[...]
...MPC is one of the most important and fundamental problems in secure distributed computing and has been studied extensively in different settings (see [19, 11, 5, 6, 18, 1, 12, 10, 2, 4, 3, 16] and their references)....
[...]
- If no faults occur, no set of size
t <n /2 of players gets any additional information (other than the function value), - Even if Byzantine faults are allowed, no set of size
t <n /3 can either disrupt the computation or get additional information.
2,298 citations
"Round Efficient Unconditionally Sec..." refers background in this paper
..., O(D)) [5, 13], to the best of our knowledge, our UMPC protocol is the first optimally resilient UMPC protocol with n = 2t+1, to provide the same....
[...]
...It is known that perfectly secure MPC tolerating At is possible iff n ≥ 3t + 1 and every two parties are directly connected by a secure channel [5]....
[...]
...MPC is one of the most important and fundamental problems in secure distributed computing and has been studied extensively in different settings (see [19, 11, 5, 6, 18, 1, 12, 10, 2, 4, 3, 16] and their references)....
[...]
2,207 citations
1,894 citations