Abstract
This chapter presents a securely deleting data structure using insights from the previous chapter. It uses a B-Tree-based data structure to provide secure deletion. We implement our design in full and analyze its performance, finding that its communication and storage overhead is small.
This is a preview of subscription content, log in via an institution to check access.
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). B-Tree-Based Secure Deletion. In: Secure Data Deletion. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-28778-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-28778-2_10
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)