Secure deletion of information from hard disk drive
View Patent ↗A method of securely deleting data from a storage medium includes generating a bitmap that corresponds to unused locations on the storage medium; initiating a background process that wipes the unused locations, where the background process runs asynchronously with a user application; wiping the unused locations; and updating the bitmap to reflect that the unused locations have been wiped. The wiping can also replace data at the unused locations with random sequences, with pseudo-random sequences, with data generated by a secure deletion algorithm, with application data from the user application, or with all zeros. The wiping can also include repeated writing of predetermined sequences to the unused locations. The unused locations correspond to blocks, clusters and/or sectors. The wiping can also replace data at unused locations that represent portions of any of blocks, clusters and sectors. The wiping can also include wiping any metadata associated with files previously stored at any of the unused locations. The bitmap can correspond to all unused locations on the storage medium. Upon a request for access of data from a wiped location, data that does not correspond to data originally stored at the wiped location can be returned. The bitmap can identify deleted files, and/or inline files, and/or temporary files that are not used by user applications.
1. A method of securely deleting data from a storage medium comprising:
generating a bitmap that determines locations to be wiped on the storage medium;
initiating a background process that wipes the locations, the background process running asynchronously with respect to a user application and independently any of file access requests issued by the user application to the locations to be wiped, the background process comprising:
wiping the locations, and
updating the bitmap to reflect that the locations have been wiped.
2. The method of claim 1 , further comprising updating the bitmap after the user application has written data to one of the locations to reflect that this location has been wiped.
3. The method of claim 1 , wherein, upon an attempt to write data to one of the locations by the user application, this location is first wiped, and then the user application's data is written to this location.
4. The method of claim 1 , wherein the wiping further comprises writing any of the following to the locations: random sequences of data, pseudo-random sequences of data, data generated by a secure deletion algorithm, and a predefined pattern.
5. The method of claim 1 , wherein the wiping further comprises repeated writing of data to any unused locations.
6. The method of claim 5 , wherein the unused locations correspond to any of clusters, sectors, sets of clusters, portions of sectors, and portions of clusters.
7. The method of claim 1 , wherein the storage medium is a hard disk drive.
8. The method of claim 1 , wherein, upon a read request for data from one of the locations, data that does not correspond to data originally stored at that location is returned.
9. The method of claim 1 , wherein the locations are unused locations.
10. The method of claim 9 , further comprising wiping any metadata previously stored at any of the unused locations.
11. The method of claim 10 , wherein the metadata is associated with deleted files.
12. The method of claim 1 , wherein the locations comprise inline files.
13. The method of claim 1 , wherein the locations include unused temporary files.
14. The method of claim 1 , wherein the locations correspond to unused space in a paging file.
15. The method of claim 1 , wherein the locations include a partially used block of a storage device.
16. The method of claim 15 , further comprising copying data from at least one desired part of the block to an intermediate location, wiping the block, and then writing the desired data from the intermediate location to the block.
17. A system for securely deleting data from a storage medium comprising:
a computer having a processor;
a bitmap that determines locations to be wiped on the storage medium; and
a background process running on the processor that wipes the locations and updates the bitmap to reflect that the locations have been wiped,
wherein the background process runs asynchronously with a user application independently of any file access requests issued by the user application to the locations to be wiped.
18. The system of claim 17 , wherein the background process replaces data at the locations with any of the following: random sequences of data, pseudo-random sequences of data, data generated by a secure deletion algorithm and a predefined pattern.
19. The system of claim 17 , wherein the background process replaces data at some of the locations with application data from the user application.
20. The system of claim 17 , wherein the background process repeatedly writes predetermined sequences to the locations.
21. The system of claim 17 , wherein the locations correspond to any of clusters, sectors, sets of clusters, portions of sectors, and portions of clusters.
22. The system of claim 17 , wherein the storage medium is a hard disk drive.
23. The system of claim 17 , wherein the background process wipes any metadata associated with files previously stored at any of the locations.
24. The system of claim 17 , wherein the bitmap corresponds to all unused locations on the storage medium.
25. The system of claim 17 , wherein, upon a request for access of data from any of the locations, data that does not correspond to data originally stored at the location is returned.
26. The system of claim 17 , wherein the bitmap includes locations that are part of deleted files.
27. The system of claim 17 , wherein the bitmap includes locations that are part of inline files.
28. The system of claim 17 , wherein the bitmap includes locations that are part of temporary files that are not used by user applications.
29. The system of claim 17 , wherein the bitmap includes locations that are part of unused space in a paging file.
30. The system of claim 17 , wherein the bitmap includes locations that are part of partially used blocks on the storage medium.
31. A computer useable medium having computer program logic stored thereon for executing on at least one processor, the computer program logic comprising:
computer program code means for generating a bitmap that determines locations to be wiped on the storage medium;
computer program code means for initiating a background process running on the at least one processor that wipes the locations, the background process running asynchronously with a user application and independently of any file access requests issued by the user application to the locations to be wiped, the background process comprising:
computer program code means for wiping the locations; and
computer program code means for updating the bitmap as locations are wiped.
32. A computer useable medium having computer program thereon for executing on at least one processor, the computer program logic comprising:
computer program code means for initiating a bitmap that determines locations to be wiped on the storage medium; and
computer program code means for running a background process running on the at least one processor that wipes the locations and updates the bitmap to reflect that the locations have been wiped, wherein the background process executes simultaneously with a user application that runs in user space and runs independently of a file access requests issued by the user application to the locations to be wiped.
33. The method of claim 1 , wherein the wiping step further comprises:
copying data of at least some locations to intermediate storage;
wiping the at least some locations; and
copying the data from the intermediate storage back to the at least some locations.