×

Data storage system and method by shredding and deshredding

  • US 7,636,724 B2
  • Filed: 09/03/2002
  • Issued: 12/22/2009
  • Est. Priority Date: 08/31/2001
  • Status: Active Grant
First Claim
Patent Images

1. A system for use with data, the system comprising:

  • a storage location;

    at least one processor coupled to the storage location;

    a memory comprising instructions executable by the at least one processor, the instructions when executed by the at least one processor implementing a customizable shredder including an allocator, a first plurality of transformers, a tag generator, and a plurality of redundancy generators,the allocator being configured to perform an allocation operation allocating the data into a selected number of portions, the selected number being greater than one, andthe first plurality of transformers applying at least one transformation to the data,the plurality of redundancy generators applying a redundancy operation to the data to add redundancy to the data, the memory further comprising instructions executable by the at least one processor, the instructions when executed by the at least one processor storing the data in the storage location as a plurality of shreds, each shred storing a portion of the data,the tag generator being configured to generate a tag for each of the plurality of shreds, the tag comprising information identifying the allocation operation, the at least one transformation, and the redundancy operation applied to the portion of the data stored in the shred and a shred order in which the allocation operation, the at least one transformation, and the redundancy operation were applied to the portion of the data stored in the shred;

    the memory further comprising instructions executable by the at least one processor, the instructions when executed by the at least one processor implementing a deshredder including a tag reader, a plurality of inverse redundancy generators, a first plurality of inverse transformers, and a deallocator,for each of at least a portion the plurality of shreds, the tag reader being configured to read the tag for the shred, identify the allocation operation, the at least one transformation, and the redundancy operation applied to the portion of the data stored in the shred and identify the shred order in which the allocation operation, the at least one transformation, and the redundancy operation were applied to the portion of the data stored in the shred, the memory further comprising instructions that when executed by the at least one processor identifies an inverse allocation operation inverse to the allocation operation applied to the portion of the data stored in the shred, at least one inverse transformation inverse to the at least one transformation applied to the portion of the data stored in the shred, an inverse redundancy operation inverse to the redundancy operation applied to the portion of the data stored in the shred, and to execute the inverse allocation operation, the at least one inverse transformation, and the inverse redundancy operation in a deshred order inverse to the shred order,the plurality of inverse redundancy generators applying the inverse redundancy operation to a portion of the plurality of shreds and outputting the portions of the data stored in each shred without the redundancy, the portion of the plurality of shreds being fewer than all of the plurality of shreds, the outputted portions of the data stored in the portion of the plurality of shreds comprising the data,the first plurality of inverse transformers applying the at least one inverse transformation to the portions of the data stored in the portion of the plurality of shreds; and

    the deallocator being configured to apply the inverse allocation operation to the portions of the data stored in the portion of the plurality of shreds.

View all claims
  • 8 Assignments
Timeline View
Assignment View
    ×
    ×