Resilient secret sharing cloud based architecture for data vault

1. A method of securely storing data in a cloud-based data vault, the method of securely storing data comprising:

fragmenting the data with a secret sharing module into a plurality, N, of secret shares of equal size according to a secret sharing algorithm, wherein a threshold number, T, of such shares is sufficient to recover the data, where T is less than N;

splitting with a persistence engine each share into data particles of equal size; and

writing with the persistence engine the data particles to storage that comprises a plurality of independent stores such that, for each share, the data particles of that share are written to an independent store corresponding to that share, the independent store including co-existing particles of data from other shares of other data, all data particles of a share being written to the same independent store and particles from different shares being written to different independent stores, each data particle having an equal size and thus being anonymous relative to other data particles and identified only by an identifier unique within its respective store, and otherwise indistinguishable from the co-existing particles of the other shares of the other data.

2. The method of claim 1 further comprising pre-storing particles of dummy data within each store, whereby the particles of data and particles of dummy data co-exist in the store.

3. The method of claim 1 , further comprising performing a clean-up process for each store, whereby particles that exist in the store are identified as having expired, whereby particles of data and particles of expired data co-exist in the store.

4. The method of claim 1 , further comprising identifying a persistence policy for storage of the data in accordance with input preferences, whereby a set of store is selected for storage of the data in accordance with the persistence policy.

5. The method of claim 1 further comprising identifying a persistence policy for storage of the data in accordance with a sensitivity attribute associated with the data.

6. The method of claim 4 , wherein polices are defined for user selection that include restrictions on attributes of the store that are to be selected to make up the set of store.

7. The method of claim 4 , wherein polices are defined for user selection that include different attributes for each of the store that are to be selected to make up the set of store.

8. The method of claim 7 wherein the attributes include identifiers of storage providers and geographical locations of the store.

9. The method of claim 4 , wherein polices are defined for user selection that include user latency preference.

10. The method of claim 4 , wherein polices are defined for user selection that include duplication of one or more shares across plural independent store.

11. The method of claim 4 , wherein polices are defined for user selection that include trustworthiness of the store.

12. The method of claim 1 further comprising monitoring a performance of each store for improvement of selection of store according to persistence policy.

13. The method of claim 1 further comprising destroying all copies of original data after a user-specified time, without any user intervention.

14. A system of securely storing data in a cloud-based data vault, the system of securely storing data comprising:

a secret sharing module executed on a processor configured to fragment the data into a plurality, N, of secret shares of equal size according to a secret sharing algorithm, wherein a threshold number, T, of such shares is sufficient to recover the data, where T is less than N;

the secret sharing module executed on a processor being further configured to split each share into data particles of equal size; and

a memory interface configured to write the data particles to storage that comprises a plurality of independent stores such that, for each share, the data particles of that share are written to an independent store corresponding to that share, the independent store including alongside co-existing particles of data from other shares of other data, all data particles of a share being written to the same independent store and particles from different shares being written to different independent stores, each data particle having an equal size and thus being anonymous relative to other data particles and identified only by an identifier unique within its respective store, and otherwise indistinguishable from the co-existing particles of the other shares of the other data.

15. The system of claim 14 wherein the system is configured to pre-store particles of dummy data within each store, whereby the particles of data and particles of dummy data co-exist in the store.

16. The system of claim 14 , wherein the system is configured to perform a clean-up process for each store, whereby particles that exist in the store are identified as having expired, whereby particles of data and particles of expired data co-exist in the store.

17. The system of claim 14 , wherein the system is configured to identify a persistence policy for storage of the data in accordance with input preferences, whereby a set of store is selected for storage of the data in accordance with the persistence policy.

18. The system of claim 14 , wherein the system is configured to destroy all copies of original data after a user-specified time, without any user intervention.

19. A non-transitory computer program product comprising instructions that when executed on a processor perform a process of securely storing data in a cloud-based data vault, the instructions of the non-transitory computer program product comprising:

fragmenting the data into a plurality, N, of secret shares of equal size according to a secret sharing algorithm, wherein a threshold number, T, of such shares is sufficient to recover the data, where T is less than N;

splitting each share into data particles of equal size; and

writing the data particles to storage that comprises a plurality of independent stores such that, for each share, the data particles of that share are written to an independent store corresponding to that share, the independent store including co-existing particles of data from other shares of other data, all data particles of a share being written to the same independent store and particles from different shares being written to different independent stores, each data particle having an equal size and thus being anonymous relative to other data particles and identified only by an identifier unique within its respective store, and otherwise indistinguishable from the co-existing particles of the other shares of the other data.

20. The non-transitory computer program product of claim 19 further comprising pre-storing particles of dummy data within each store, whereby the particles of data and particles of dummy data co-exist in the store.

21. The non-transitory computer program product of claim 19 , further comprising performing a clean-up process a clean-up process for each store, whereby particles that exist in the store are identified as having expired, whereby particles of data and particles of expired data co-exist in the store.

22. The non-transitory computer program product of claim 19 , further comprising identifying a persistence policy for storage of the data in accordance with input preferences, whereby a set of store is selected for storage of the data in accordance with the persistence policy.

23. The non-transitory computer program product of claim 19 , further comprising destroying all copies of original data after a user-specified time, without any user intervention.