Showing papers on "Upload published in 1969"
TL;DR: An efficient mechanism to guarantee the integrity of cloud storage systems using network-coding-based regenerating codes, and a group testing method for linear functions based on bisections, whose worst case scenario is not worse than transmitting each file individually.
Abstract: In this article, we present an efficient mechanism to guarantee the integrity of cloud storage systems using network-coding-based regenerating codes. Regenerating codes are a special type of erasure codes with the property that regenerating a failed encoded server, can be done using significantly less information than the size of the original data. Our proposal includes two protocols that allow a file owner to verify an outsourced storage facility is storing its information without downloading the file itself. One of them can be used an unlimited number of times (unbounded use), but involves higher information transmission for a single verification. The other one, must precompute results in advance (bounded use), but has a lower overhead for each verification. For the bounded-use proposal, we make use of the linear properties of the dot product and special key management strategies to reduce the overhead in systems with many servers. In addition to these protocols, we present a way to guarantee the file can be recovered by any combination of at least k servers in polynomial time in the number of servers. As an additional application, we present how our constructions can be used to reduce network usage for users, when uploading personal multimedia libraries to cloud music services. For this application, we devised a group testing method for linear functions based on bisections, whose worst case scenario is not worse than transmitting each file individually. Since our result applies independently of the composition of the input, the method is of independent interest.
2 citations