Multi-party computation method and system for distributed processors with asymmetric network resources

A system for asymmetric multi-party computation, the system comprising:

• a network device configured for establishing data communications channels over a computerized network among a set of distributed computerized processors, wherein a first subset of the computerized processors are at relatively fast parties and a second subset of the computerized processors are at relatively slower parties;
• a set of processors configured for:
• identifying the set of fast parties and the set of slow parties based on predetermined or detected network performance metrics, wherein channels between fast parties have a relatively small delay, and channels that contain at least one slow party have a relatively large delay;
• during a pre-processing phase, the set of fast parties performing an oblivious transfer (OT)-extension protocol to establish an OT channel between each pair of fast parties to generate correlated randomness values for the fast parties, wherein the fast parties do not know the other values;
• electronically storing a set of inputs at the set of slow parties and the set of fast parties, wherein the input at any party is unique and not known to the other parties;
• at each of the fast parties, executing an unconditional OT-based protocol over the communication channels for dishonest majority to execute instructions for generating an output;
• electronically storing the output of the execution of the instructions at each of the fast parties;
• and
• transmitting over the data communications channels the output from each of the fast parties to each of the other fast parties and each of the slow parties.

A non-transitory processor-readable medium storing code representing instructions to be executed by a processor at a compute device for asymmetric multi-party computation, the code further comprising commands for:

• establishing data communications channels over a computerized network among a set of distributed computerized processors, wherein a first subset of the computerized processors are at relatively fast parties and a second subset of the computerized processors are at relatively slower parties;
• identifying the set of fast parties and the set of slow parties based on predetermined or detected network performance metrics, wherein channels between fast parties have a relatively small delay, and channels that contain at least one slow party have a relatively large delay;
• during a pre-processing phase, the set of fast parties performing an oblivious transfer (OT)-extension protocol to establish an OT channel between each pair of fast parties to generate correlated randomness values for the fast parties, wherein the fast parties do not know the other values;
• electronically storing a set of inputs at the set of slow parties and the set of fast parties, wherein the input at any party is unique and not known to the other parties;
• at each of the fast parties, executing an unconditional OT-based protocol over the communication channels for dishonest majority to execute instructions for generating an output;
• electronically storing the output of the execution of the instructions at each of the fast parties;
• and
• transmitting over the data communications channels the output from each of the fast parties to each of the other fast parties and each of the slow parties.