Abstract
This chapter presents a general approach to the design and analysis of secure deletion for persistent storage that relies on encryption and key wrapping. It defines a key disclosure graph that models the adversarial knowledge over a history of key generation and wrapping. We define a generic update function, expressed as a graph mutation for the key disclosure graph, and prove that this update function achieves secure deletion. Instances of the update function implement the update behaviour of all tree-like data structures including B-Trees, extendible hash tables, linked lists, and others.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Reardon, J. (2016). Secure Data Deletion from Persistent Media. In: Secure Data Deletion. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-28778-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-28778-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28777-5
Online ISBN: 978-3-319-28778-2
eBook Packages: Computer ScienceComputer Science (R0)