Tagged Questions
2
votes
1answer
70 views
What's efficient MPC protocol for determining if sum's bigger than y?
My secure multi-party computation (MPC) in need is simply to determine if a sum of two private variable is bigger than a given value $y$, as
$f(x_0, x_1) = [(x_0 + x_1) > y]$
in which the value ...
0
votes
2answers
124 views
homomorphic encryption special case of multi party computation?
I read that Fully Homomorphic Encryption schemes are special case of Secure MPC in page no 3. Especially , generalization of two party computation problems stated by Yao
But is there any additional ...
0
votes
1answer
118 views
Are there any multiparty homomorphic encryption schemes?
Are there any multiparty homomorphic encryption schemes ?
Most of the literature is about two party schemes .
Is there any generalization made for n party ?
3
votes
1answer
178 views
what is this kind of multi party computation
The classic multi party computation protocols are defined around " Untrusted parties trying to compute something together"
But is there a crypto abstraction for , "Trusted parties trying to compute ...
2
votes
2answers
229 views
secure multiparty computation for multiplication
Suppose there are $N$ parties $p_j$, each with a binary $b_j\in{\{0,1\}}$. The problem needs to compute the multiplication of number of ones times that of zeros, that is, ...
