Cloud Storage Integrity at Scale: A Case for Dynamic Hash Trees

arXiv:2405.03830v1 Announce Type: new
Abstract: Merkle hash trees are the state-of-the-art method to protect the integrity of storage systems. However, using a hash tree can severely degrade performance, and prior works optimizing them have yet to yield a concrete understanding of the scalability of certain designs in the context of large-scale cloud storage systems. In this paper, we take a first-principles approach to analyzing hash tree performance for storage by introducing a definition of an optimal hash tree and a …

art arxiv can case cloud cloud storage concrete context cs.cr dynamic hash integrity merkle performance protect scalability scale state storage storage systems systems trees understanding