arXiv · 2405.03830
On Scalable Integrity Checking for Secure Cloud Disks
Abstract
Merkle hash trees are the standard method to protect the integrity and freshness of stored data. However, hash trees introduce additional compute and I/O costs on the I/O critical path, and prior efforts have not fully characterized these costs. In this paper, we quantify performance overheads of storage-level hash trees in realistic settings. We then design an optimized tree structure called Dynamic Merkle Trees (DMTs) based on an analysis of root causes of overheads. DMTs exploit patterns in workloads to deliver up to a 2.2x throughput and latency improvement over the state of the art. Our novel approach provides a promising new direction to achieve integrity guarantees in storage efficiently and at scale.
Explore related subjects
Keep this discovery
Quinn Burke, Ryan Sheatsley, Rachel King, Owen Hines, Michael Swift, Patrick McDaniel. 2024-05-06. On Scalable Integrity Checking for Secure Cloud Disks. https://arxiv.org/abs/2405.03830
Cite the original work for its findings. Save a collection to share your selection of sources.