Systems and methods for managing data based on secret sharing

A system comprising:

• at least one processor;
• and
• a memory storing instructions that, when executed by the at least one processor, cause the system to perform:
• obtaining data to be secured based on a secret sharing technique, the data being associated with a file identifier and a split specification that defines at least a number of n split stores a minimum number of splits m (2≤m≤n) required for reconstructing the data, and a scheme for a randomly seek-able Repeatable Random Sequence Generator (RRSG);
• initializing an RRSG state based at least in part on a given data transformation key to provide repeatable sequence of random bytes;
• and
• for every m bytes of data:
• determining a polynomial of order (m−1) comprising a plurality of coefficients that are determined based at least in part on the m bytes of the data and a portion of the repeatable sequence of random bytes, wherein the determining further comprises:
• determining each coefficient in the determined polynomial based on a combination of at least one byte in the m bytes of the data and at least one portion of the repeatable sequence of random bytes;
• evaluating the polynomial at n distinct non-zero values determined by the portion of the repeatable sequence of random bytes to generate n bytes, wherein each byte in the generated n bytes corresponds to one of the n split stores defined by the split specification;
• and
• storing each byte of the generated n bytes into one of the defined n split stores.

A non-transitory computer-readable storage medium including instructions that, when executed by at least one processor of a computing system, cause the computing system to perform:

• obtaining data to be secured based on a secret sharing technique, the data being associated with a file identifier and a split specification that defines at least a number of n split stores a minimum number of splits m (2≤m≤n) required for reconstructing the data, and a scheme for a randomly seek-able Repeatable Random Sequence Generator (RRSG);
• initializing an RRSG state based at least in part on a given data transformation key to provide repeatable sequence of random bytes;
• and
• for every m bytes of data:
• determining a polynomial of order (m−1) comprising a plurality of coefficients that are determined based at least in part on the m bytes of the data and a portion of the repeatable sequence of random bytes, wherein the determining further comprises:
• determining each coefficient in the determined polynomial based on a combination of at least one byte in the m bytes of the data and at least one portion of the repeatable sequence of random bytes;
• evaluating the polynomial at n distinct non-zero values determined by the portion of the repeatable sequence of random bytes to generate n bytes, wherein each byte in the generated n bytes corresponds to one of the n split stores defined by the split specification;
• and
• storing each byte of the generated n bytes into one of the defined n split stores.