Tape backup method

Abstract

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 - 23 . (canceled) 
     
     
         24 . A method for backing up a data set, the method comprising:
 generating one or more portions of data from the data set based at least in part on a key, wherein each of the one or more portions of data contains units of data of a respective subset of the data set that have been shuffled from an original order; and   storing the one or more portions of data on one or more backup tapes by accessing a logical mount point that points to one or more backup tapes, wherein   the data set is restorable from a threshold number of the one or more portions of data.   
     
     
         25 . The method of  claim 24 , further comprising digitally protecting each backup tape with a value selected from the group consisting of Secure Hash Algorithm-256 (SHA-256), Hash-based Message Authentication Code (HMAC) hash value, and any combination thereof. 
     
     
         26 . The method of  claim 25 , further comprising determining whether each backup tape is capable of being used to restore the data set according to whether the value changed. 
     
     
         27 . The method of  claim 24 , further comprising splitting the key into at least two portions using a secret sharing algorithm. 
     
     
         28 . The method of  claim 27 , wherein the secret sharing algorithm is selected from the group consisting of Shamir and Blakely. 
     
     
         29 . The method of  claim 27 , wherein the one or more portions of data contains at least a portion of the key. 
     
     
         30 . The method of  claim 29 , wherein restoring the data set requires at least two portions of the key. 
     
     
         31 . The method of  claim 24 , wherein the one or more portions of data respectively contains a substantially random distribution of the respective subset of the data set. 
     
     
         32 . The method of  claim 24 , wherein each of the one or more portions of data are stored on a separate backup tape. 
     
     
         33 . The method of  claim 32 , wherein a first backup tape is located at a different geographical location than a second backup tape. 
     
     
         34 . A system for backing up a data set, the system comprising:
 a tape backup system comprising a number of backup tapes for storing data; and   a hardware processor configured to:
 generate one or more portions of data from the data set based at least in part on a key, wherein each of the one or more portions of data contains units of data of a respective subset of the data set that have been shuffled from the original order; and 
   store the one or more portions of data on one or more backup tapes by accessing a logical mount point that points to one or more backup tapes, wherein   the data set is restorable from a threshold number of the one or more portions of data.   
     
     
         35 . The system of  claim 34 , the hardware processor further configured to digitally protect each backup tape with a value selected from the group consisting of Secure Hash Algorithm-256 (SHA-256), Hash-based Message Authentication Code (HMAC) hash value, and any combination thereof. 
     
     
         36 . The system of  claim 35 , the hardware processor further configured to determine whether each backup tape is capable of being used to restore the data set according to whether the value changed. 
     
     
         37 . The system of  claim 34 , the hardware processor further configured to split the key into at least two portions using a secret sharing algorithm. 
     
     
         38 . The system of  claim 37 , wherein the secret sharing algorithm is selected from the group consisting of Shamir and Blakely. 
     
     
         39 . The system of  claim 37 , wherein the one or more portions of data contains at least a portion of the key. 
     
     
         40 . The system of  claim 38 , wherein restoring the data set requires at least two portions of the key. 
     
     
         41 . The system of  claim 34 , wherein the one or more portions of data respectively contains a substantially random distribution of a respective subset of the data set. 
     
     
         42 . The system of  claim 34 , wherein each of the one or more portions of data are stored on a separate backup tape. 
     
     
         43 . The system of  claim 42 , wherein a first backup tape is located at a different geographical location than a second backup tape.