Secure data parser method and system
View Patent ↗A secure data parser is provided that may be integrated into any suitable system for securely storing and communicating data. The secure data parser parses data and then splits the data into multiple portions that are stored or communicated distinctly. Encryption of the original data, the portions of data, or both may be employed for additional security. The secure data parser may be used to protect data in motion by splitting original data into portions of data, that may be communicated using multiple communications paths.
1. A method performed by a computer system for securing a first data set while providing recoverability of the first data set in the event of unavailability of data at one or more storage locations, the method comprising:
(a) reading the first data set from a memory that stores the first data set,
(b) processing the first data set to produce a second data set, the processing comprising:
encrypting the first data set using an encryption key to produce an encrypted data set, and
logically combining at least a portion of the encrypted data set with the encryption key to produce a resultant,
wherein the second data set comprises the encrypted data set and the resultant, and wherein all of the at least a portion of the encrypted data set is required to recover the encryption key based on the resultant;
(c) producing redundancy information based on information in the second data set;
(d) producing a plurality of n shares from the second data set, wherein each of the n shares comprises at least some of the second data set; and
(e) storing the plurality of n shares and the redundancy information, wherein at least some of the n shares are stored in separate storage locations and the first data set is recoverable using at least a threshold number, less than n, of the plurality of n shares.
2. The method of claim 1 , wherein each of the n shares further comprises at least some of the redundancy information and storing the plurality of n shares and the redundancy information comprises storing the redundancy information in the n shares.
3. The method of claim 2 , wherein storing the redundancy information in the n shares comprises including in each of the n shares information redundant to information included in at least one other of the n shares.
4. The method of claim 1 , wherein producing the plurality of n shares comprises causing the n shares to comprise a substantially random distribution of units of data of the second data set.
5. The method of claim 4 , wherein causing the n shares to comprise a substantially random distribution comprises using a key.
6. The method of claim 5 , wherein substantially randomly distributing units of data comprises using a key.
7. The method of claim 1 , wherein producing the plurality of n shares comprises substantially randomly distributing units of data of the second data set into the plurality of n shares.
8. The method of claim 1 , wherein producing the plurality of n shares comprises distributing units of data into the plurality of n shares and substantially randomly shuffling the units of data in the shares.
9. The method of claim 8 , wherein substantially randomly shuffling the units of data comprises using a key.
10. The method of claim 1 , wherein at least some of the separate storage locations are geographically separate from one another.
11. The method of claim 1 , wherein logically combining comprises logically combining using an exclusive-OR operation.
12. The method of claim 1 , wherein the at least a portion of the encrypted data set comprises all of the encrypted data set.
13. A computer system for securing a first data set while providing recoverability of the first data set in the event of unavailability of data at one or more storage locations, the system comprising:
one or more processors configured to:
(a) produce a second data set from the first data set by:
encrypting the first data set using an encryption key to produce an encrypted data set, and
logically combining at least a portion of the encrypted data set with the encryption key to produce a resultant, wherein the second data set comprises the encrypted data set and the resultant, and wherein all of the at least a portion of the encrypted data set is required to recover the encryption key based on the resultant;
(b) produce redundancy information based on information in the second data set;
(c) produce a plurality of n shares from the second data set, wherein each of the n shares comprises at least some of the second data set; and
(d) store the plurality of n shares and the redundancy information in a plurality of storage locations, wherein at least some of the n shares are stored in separate storage locations and the first data set is recoverable using at least a threshold number, less than n, of the plurality of n shares.
14. The system of claim 13 , wherein the one or more processors is configured to store the plurality of n shares and the redundancy information by storing the redundancy information in the n shares.
15. The system of claim 14 , wherein the one or more processors is configured to store the redundancy information in the n shares by including in each of the n shares information redundant to information included in at least one other of the n shares.
16. The system of claim 13 , wherein the one or more processors is configured to produce the plurality of n shares by causing the n shares to comprise a substantially random distribution of units of data of the second data set.
17. The system of claim 16 , wherein the one or more processors is configured to cause the n shares to comprise a substantially random distribution by using a key.
18. The system of claim 13 , wherein the one or more processors is configured to produce the plurality of n shares by substantially randomly distributing units of data of the second data set into the plurality of n shares.
19. The system of claim 18 , wherein the one or more processors is configured to substantially randomly distribute units of data by using a key.
20. The system of claim 13 , wherein the one or more processors is configured to produce the plurality of n shares by distributing units of data into the plurality of n shares and substantially randomly shuffling the units of data in the shares.
21. The system of claim 20 , wherein the one or more processors is configured to substantially randomly shuffle the units of data by using a key.
22. The system of claim 13 , wherein at least some of the separate storage locations are geographically separate from one another.
23. The system of claim 13 , wherein the one or more processors is configured to logically combine by logically combining using an exclusive-OR operation.
24. The system of claim 13 , wherein the at least a portion of the encrypted data set comprises all of the encrypted data set.
25. A non-transitory computer-readable medium comprising instructions that, when executed by one or more processors, cause a computer system to carry out a method for securing a first data set while providing recoverability of the first data set in the event of unavailability of data at one or more storage locations, the method comprising:
(a) reading the first data set from a memory that stores the first data set,
(b) producing a second data set from the first data set, said producing comprising:
encrypting the first data set using an encryption key to produce an encrypted data set, and
logically combining at least a portion of the encrypted data set with the encryption key to produce a resultant,
wherein the second data set comprises the encrypted data set and the resultant, and wherein all of the at least a portion of the encrypted data set is required to recover the encryption key based on the resultant;
(c) producing redundancy information based on information in the second data set;
(d) producing a plurality of n shares from the second data set, wherein each of the n shares comprises at least some of the second data set; and
(e) storing the plurality of n shares and the redundancy information, wherein at least some of the n shares are stored in separate storage locations and the first data set is recoverable using at least a threshold number, less than n, of the plurality of n shares.
26. The non-transitory computer-readable medium of claim 25 , wherein storing the plurality of n shares and the redundancy information comprises storing the redundancy information in the n shares.
27. The non-transitory computer-readable medium of claim 26 , wherein storing the redundancy information in the n shares comprises including in each of the n shares information redundant to information included in at least one other of the n shares.
28. The non-transitory computer-readable medium of claim 25 , wherein producing the plurality of n shares comprises causing the n shares to comprise a substantially random distribution of units of data of the second data set.
29. The non-transitory computer-readable medium of claim 28 , wherein causing the n shares to comprise a substantially random distribution comprises using a key.
30. The non-transitory computer-readable medium of claim 25 , wherein the at least a portion of the encrypted data set comprises all of the encrypted data set.