CRYPTO '89 Proceedings on Advances in cryptology
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Remembrance of Data Passed: A Study of Disk Sanitization Practices
IEEE Security and Privacy
Off-the-record communication, or, why not to use PGP
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Secure deletion of data from magnetic and solid-state memory
SSYM'96 Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6
SSYM'96 Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6
B-trees, shadowing, and clones
ACM Transactions on Storage (TOS)
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
The ephemerizer: making data disappear
The ephemerizer: making data disappear
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A survey of confidential data storage and deletion methods
ACM Computing Surveys (CSUR)
Vanish: increasing data privacy with self-destructing data
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
IEEE Communications Magazine
Data node encrypted file system: efficient secure deletion for flash memory
Security'12 Proceedings of the 21st USENIX conference on Security symposium
SP '13 Proceedings of the 2013 IEEE Symposium on Security and Privacy
| Hi-index | 0.00 |
Secure deletion is the task of deleting data irrecoverably from a physical medium. In this work, we present a general approach to the design and analysis of secure deletion for persistent storage that relies on encryption and key wrapping. We define a key disclosure graph that models the adversarial knowledge of the history of key generation and wrapping. We introduce a generic update function and prove that it achieves secure deletion of data against a coercive attacker; instances of the update function implement the update behaviour of all arborescent data structures including B-Trees, extendible hash tables, linked lists, and others. We implement a B-Tree instance of our solution. Our implementation is at the block-device layer, allowing any block-based file system to be used on top of it. Using different workloads, we find that the storage and communication overhead required for storing and retrieving B-Tree nodes is small and that this therefore constitutes a viable solution for many applications requiring secure deletion from persistent media.