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 through ASFL language, but it does not provide a good library for ECC operations.

Instead, CHARM implements several cryptographic functionalities, but without MPC.

Is there anything that combines the two approaches? (Both MPC and ECC operations)?

Edit: This question is about ECC operations as one component in a general MPC scheme.




If you are looking to implement private ECC operations using BMR, then you need to convert these operations first into a Boolean circuit. This will be extremely expensive and not the way to go. Rather, you need a direct protocol for this. Note that there are secure protocols for ECDSA, if this is what you are looking for.

  • 1
    $\begingroup$ The problem is that the ECC operation is just one component in the function that I try to compute. The full computation involves ECC multiplication, modular multiplication, modular addition, hash and Lagrange extrapolation. I know it seems a lot, but it uses only one ECC multiplication. That is the reason I try to use general MPC scheme. When you say extremely expensive is a matter of months or minutes/ seconds? (I don't mind that it will take minutes..) $\endgroup$ Jun 19 '18 at 19:26
  • $\begingroup$ Do you think to implement it with spdz2k protocol will be better? (It is working over the ring $Z_{2^k}$) $\endgroup$ Jul 1 '18 at 15:43
  • $\begingroup$ I suggest that you estimate the size of the circuit and then use that to estimate the running time. $\endgroup$ Jul 1 '18 at 18:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.