DMCA
Efficient Dynamic Provable Possession of Remote Data via Balanced Update Trees
Cached
Download Links
| Citations: | 2 - 0 self |
BibTeX
@MISC{Zhang_efficientdynamic,
author = {Yihua Zhang and Marina Blanton},
title = {Efficient Dynamic Provable Possession of Remote Data via Balanced Update Trees},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The emergence and availability of remote storage providers prompted work in the security community that allows a client to verify integrity and availability of the data she outsourced to an untrusted remove storage server at a relatively low cost. Most recent solutions to this problem allow the client to read and update (insert, modify, or delete) stored data blocks while trying to lower the overhead associated with verifying data integrity. In this work we develop a novel and efficient scheme, computation and communication overhead of which is orders of magnitude lower than those of other state-of-the-art schemes. Our solution has a number of new features such as a natural support for operations on ranges of blocks, and revision control. The performance guarantees that we achieve stem from a novel data structure, termed balanced update tree, and removing the need to verify update operations.
Keyphrases
balanced update tree efficient dynamic provable possession remote data update operation data integrity low cost communication overhead performance guarantee untrusted remove storage server efficient scheme state-of-the-art scheme natural support novel data structure revision control recent solution remote storage provider data block security community new feature
