US 12,406,254 B2
Multi-party computation in a computer sharding environment
Hubert Andre Le Van Gong, San Jose, CA (US); and Jinesh Patel, Cedar Park, CA (US)
Assigned to PAYPAL, INC., San Jose, CA (US)
Filed by PAYPAL, INC., San Jose, CA (US)
Filed on Sep. 21, 2023, as Appl. No. 18/471,726.
Application 18/471,726 is a continuation of application No. 17/543,143, filed on Dec. 6, 2021, granted, now 11,803,844.
Prior Publication US 2024/0135369 A1, Apr. 25, 2024
Int. Cl. G06Q 20/00 (2012.01); G06Q 20/38 (2012.01); H04L 9/08 (2006.01); H04L 9/00 (2022.01)
CPC G06Q 20/3825 (2013.01) [G06Q 20/38215 (2013.01); G06Q 20/3829 (2013.01); H04L 9/08 (2013.01); H04L 9/50 (2022.05); H04L 2209/56 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system, comprising:
a non-transitory memory; and
one or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising:
monitoring operations of a plurality of computer nodes associated with a shard chain in a plurality of shard chains;
detecting a change of one or more attributes associated with the shard chain based on the monitored operations;
determining, for the shard chain and based on the change of the one or more attributes, a multi-party computation scheme for validating transactions conducted through the shard chain, the multi-party computation scheme specifying a minimum number of computer node requirement for validating the transactions;
determining a key required for performing a transaction validation computation according to the multi-party computation scheme;
decomposing the key into a plurality of shares of the key based on the minimum number of computer node requirement; and
configuring the plurality of computer nodes according to the multi-party computation scheme, wherein the configuring comprises distributing different subsets of the plurality of shares of the key to different computer nodes in the plurality of computer nodes according to a distribution arrangement that enables a first subset of the plurality of computer nodes that meets the minimum number of computer node requirement to re-generate the key based on first shares of the key stored on the first subset of the plurality of computer nodes, and prevents a second subset of the plurality of computer nodes that does not meet the minimum number of computer node requirement from re-generating the key based on second shares of the key stored on the second subset of the plurality of computer nodes.