Search Results

Is it possible to use BGW scheme, to compute (private value) power of some other private input? I believe that it's not possible, because this scheme allow only multiplication and addition. Where he …

If we put in the set $H(x||r)$ instead of x where $r$ is a large enough random value (w.l.o.g assume each x is in the same length). Then, each player can add values without revealing it and the same i …

To test whether a secret value $[x]$ is zero, where $x \in [0,2^{k−1}]$, SPDZ uses the a based on the method of Catrina and de Hoogh [1]. This method requires to working on a field with modulus $p>2^ …

Is it feasible to generate an efficient MPC function that compute $a^{-1}$ for $a \in \mathbb{F_q}$, with Boolean circuit? The naive way seems impossible since the depth of the computation might need …

I want to implement computing ECC operations (i.e., multiplication) in a BMR scheme (secure multi-party computation) What is the best way to do it? I found Fairplay MPC - to allow BMR computation thro …

Given two parties who have private inputes Player 1 - $X_1,...X_n$ Player 2 - $Y_1,...Y_n$ We want to compute a solution to a linear system equation: $f_1(X_1,...X_n,...Y_1,...Y_n) +h_1(X_1,...X_ …

Given two players $P_1 , P_2$ . In our setting $P_1$ poses two encrypted matrices $M_{1_{k \times k}},M_{2_{k \times k}}$ over field $F$, and the encryption has additive homomorphic property, over pu …

According to Protocol A that was presented in Section 3.1 paper entitled "Some Efficient Solutions to Yao’s Millionaire Problem" (2013). [1] In that protocol they used an assumption that there is a …