Memory efficient sanitization of a deduplicated storage system

Proceedings of the 11th USENIX Conference on File and Storage Technologies, FAST 2013

Volumn , Issue , 2013, Pages 81-94

  Botelho, Fabiano C ^a   Shilane, Philip ^a   Garg, Nitin ^a   Hsu, Windsor ^a  

^a GNSS Technology for Rail Transportation

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY; ECONOMIC AND SOCIAL EFFECTS;

MEMORY EFFICIENT; MEMORY REQUIREMENTS; MEMORY-EFFICIENT ALGORITHMS; PERFECT HASHING; SANITIZATION TECHNIQUES; STORAGE CAPACITY; STORAGE SYSTEMS; THREAT MODELING;

DIGITAL STORAGE;

EID: 85080000365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (50)

1. A guide to understanding data remanence in automated information systems. http://www.cerberussystems.com/ INFOSEC/stds/ncsctg25.htm, May 2012.
2. A. Adya, W. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. Douceur, J. Howell, J. Lorch, M. Theimer, and R. Wattenhofer. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. ACM SIGOPS Operating Systems Review, 36(SI):1-14, 2002.
3. D. Belazzougui, F. C. Botelho, and M. Dietzfelbinger. Hash, displace, and compress. In Proceedings of the 17th Annual European Symposium on Algorithms, ESA09, pages 682-693, 2009.
4. M. A. Bender, M. Farach-Colton, R. Johnson, R. Kraner, B. C. Kuszmaul, D. Medjedovic, P. Montes, P. Shetty, R. P. Spillane, and E. Zadok. Dont thrash: How to cache your hash on flash. In Proceedings of the 38th International Conference on Very Large Data Bases, 2012.
5. D. Bhagwat, K. Eshghi, D. D. Long, and M. Lillibridge. Extreme binning: scalable, parallel deduplication for chunk-based file backup. In Proceedings of the 17th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Sept. 2009.
6. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, July 1970.
7. F. C. Botelho, A. Lacerda, G. V. Menezes, and N. Ziviani. Minimal perfect hashing: A competitive method for indexing internal memory. Information Sciences, 181(13):2608-2625, 2011.
8. F. C. Botelho, R. Pagh, and N. Ziviani. Practical perfect hashing in nearly optimal space. Information Systems, June 2012. http://dx.doi.org/10.1016/j.is.2012.06.002.
9. F. C. Botelho, N. C. Wormald, and N. Ziviani. Cores of random r-partite hypergraphs. Information Processing Letters, 112(8-9):314-319, 2012.
10. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2005.
11. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The bloomier filter: an efficient data structure for static support lookup tables. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA04), pages 30-39, 2004.
12. A. Clements, I. Ahmad, M. Vilayannur, and J. Li. Decentralized deduplication in SAN cluster file systems. In Proceedings of the USENIX Annual Technical Conference, 2009.
13. Z. Czech, G. Havas, and B. Majewski. Fundamental study perfect hashing. Theoretical Computer Science, 182:1-143, 1997.
14. Z. Deng, E. Yenilmez, J. Leu, J. Hoffman, E. Straver, H. Dai, and K. Moler. Metal-coated carbon nanotube tips for magnetic force microscopy. 85(25), 2004.
15. M. Dietzfelbinger and R. Pagh. Succinct data structures for retrieval and approximate membership. In Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I, ICALP 08, pages 385-396. Springer-Verlag, 2008.
16. D. S. Directorate. Australian government information and communications technology security manual. 2006.
17. C. Dubnicki, L. G. L. Heldt, M. Kaczmarczyk, P. S. Wojciech Kilian, J. Szczepkowski, C. Ungureanu, and M. Welnicki. Hydrastor: A scalable secondary storage. In Proceedings of the 7th USENIX Conference on File and Storage Technologies, 2009.
18. EMC Corporation. Data Domain. http:// www.emc.com/backup-and-recovery/ data-domain/data-domain.htm/, 2012.
19. Eraser. http://eraser.heidi.ie/.
20. M. L. Fredman and J. Komlós. On the size of separating systems and families of perfect hashing functions. SIAM Journal on Algebraic and Discrete Methods, 5:61-68, 1984.
21. K. Fredriksson and F. Nikitin. Simple compression code supporting random access and fast string matching. In Proceedings of the 6th international conference on Experimental algorithms, WEA07, pages 203-216. Springer-Verlag, 2007.
22. S. Garfinkel. Security and Usability: Designing Secure Systems That People Can Use, chapter 15: Sanitization and Usability, pages 293-318. 2005.
23. S. Garfinkel and A. Shelat. Remembrance of data passed: a study of disk sanitization practices. IEEE Security & Privacy, 1(1):17-27.
24. F. Guo and P. Efstathopoulos. Building a highperformance deduplication system. In Proceedings of the USENIX Annual Technical Conference, 2011.
25. P. Gutmann. Secure deletion of data from magnetic and solid-state memory. In Proceedings of the 6th conference on USENIX Security Symposium, Fo-cusing on Cryptography, July 1996.
26. T. Hagerup and T. Tholey. Efficient minimal perfect hashing in nearly minimal space. In Proceedings of the 18th Symposium on Theoretical Aspects of Computer Science (STACS01), pages 317-326. Springer LNCS vol. 2010, 2001.
27. G. Hughes and T. Coughlin. Tutorial on disk drive sanitization. https: //cmrr.ucsd.edu/people/Hughes/ DataSanitizationTutorial.pdf.
28. R. Kissel, M. Scholl, S. Skolochenko, and X. Li. Guidelines for Media Sanitization: Special Publication 800-88, Recommendations of the National Institute of Standards and Technology, Computer Security Division, September 2006.
29. M. Lillibridge, K. Eshghi, D. Bhagwat, V. Deolalikar, G. Trezise, and P. Camble. Sparse indexing: large scale, inline deduplication using sampling and locality. In Proceedings of the 7th USENIX Conference on File and Storage Technologies, pages 111-123, 2009.
30. LSoft Technologies Inc. Active@KillDisk. http: //www.killdisk.com/.
31. U. Manber. Finding similar files in a large file system. In Proceedings of the USENIX Winter Technical Conference, pages 1-10, 1994.
32. N. Mandagere, P. Zhou, M. A. Smith, and S. Uttamchandani. Demystifying data deduplication. In Proceedings of ACM/IFIP/USENIX Middleware Conference, 2008.
33. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, 1984.
34. National Security Agency Central Security Service. Evaluated Products List-Degausser, 2012.
35. NetApp. NetApp ONTAP. http: //www.netapp.com/us/products/ platform-os/dedupe.html, 2012.
36. R. Perlman. File system design with assured delete. In Network and Distributed System Security Symposium, 2007.
37. M. Rosenblum and J. K. Ousterhout. The design and implementation of a log-structed file system. In Proceedings of the 13th Symposium on Operating Systems Principles, 1991. Published as Operating Systems Review.
38. J. P. Schmidt and A. Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing, 19(5):775-786, October 1990.
39. K. Srinivasan, T. Bisson, and G. G. K. Voruganti. iDedup: Latency-aware, inline data deduplication for primary storage. In Proceedings of the 10th USENIX Conference on File and Storage Technologies, 2012.
40. M. Storer, K. Greenan, D. Long, and E. Miller. Secure data deduplication. In Proceedings of the 4th ACM international workshop on Storage security and survivability, pages 1-10. ACM, 2008.
41. S. Swanson and M. Wei. Safe: Fast, verifiable sanitization for ssds. http://nvsl.ucsd.edu/ sanitize/, 2010.
42. Symantec. Symantec NetBackup Pure-Disk. http://www.symantec.com/ netbackup-puredisk, 2012.
43. Y. Tang, P. Lee, J. Lui, and R. Perlman. Fade: Secure overlay cloud storage with file assured deletion. Security and Privacy in Communication Networks, pages 380-397, 2010.
44. US Department of Defense National Industrial Security Program. U.S. National Industrial Security Program Operating Manual (DoD 5220.22-M), 2006.
45. C. Valli and A. Jones. A UK and Australian Study of Hard Disk Disposal. In 3rd Australian Computer, Information and Network Forensics Conference, 2005.
46. S. Vigna. Broadword implementation of rank/select queries. In Proceedings of the 7th international conference on Experimental algorithms, WEA08, pages 154-168. Springer-Verlag, 2008.
47. G. Wallace, F. Douglis, H. Qian, P. Shilane, S. Smaldone, M. Chamness, and W. Hsu. Characteristics of backup workloads in production systems. In Proceedings of the 10th USENIX Conference on File and Storage Technologies, 2012.
48. J. Wei, H. Jiang, K. Zhou, and D. Feng. MAD2: A scalable high-throughput exact deduplication approach for network backup services. In Proceedings of the IEEE 26th Symposium on Mass Storage Systems and Technologies, 2010.
49. M.Wei, L. M. Grupp, F. E. Spada, and S. Swanson. Reliably erasing data from flash-based solid state drives. In Proceedings of the 9th USENIX Conference on File and Storage Technologies, Feb 2011.
50. B. Zhu, K. Li, and H. Patterson. Avoiding the disk bottleneck in the Data Domain deduplication file system. In Proceedings of the 6th USENIX Conference on File and Storage Technologies, pages 269-282, February 2008.