Efficiently binding data to owners in distributed content-addressable storage systems
Eaton, P.
Weatherspoon, H.
Kubiatowicz, J.
California Univ., Berkeley, CA;
This paper appears in: Security in Storage Workshop, 2005. SISW '05. Third IEEE International
Publication Date: 13-13 Dec. 2005
On page(s): 12 pp.-51
Location: San Francisco, CA,
ISBN: 0-7695-2537-7
INSPEC Accession Number: 8968213
Digital Object Identifier: 10.1109/SISW.2005.4
Current Version Published: 2006-05-08
Abstract
Distributed content-addressable storage systems use self-verifying data to protect data integrity and to enable graceful scaling. One feature commonly missing from these systems, however, is the ability to identify the owner of a piece of data in a non-repudiable manner. While a solution that associates a certificate with each block of data is conceptually simple, researchers have traditionally claimed that the cost of creating and maintaining certificates is too great. In this paper, we demonstrate that systems can, in fact, efficiently map data to its owner in a secure and non-repudiable fashion. To reduce the cost of creating and maintaining certificates, we extend the traditional content-addressable interface to allow the aggregation of many small data blocks into larger containers. The aggregation is performed in a way that also supports self-verifying data at the granularity of the block and container, fine-granularity access, and incremental updates. We describe two prototype implementations and present preliminary performance results from deployments on PlanetLab and a local cluster
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
