ACM Home Page
Please provide us with feedback. Feedback
POTSHARDS—a secure, recoverable, long-term archival storage system
Full text PdfPdf (661 KB)
Source
ACM Transactions on Storage (TOS) archive
Volume 5 ,  Issue 2  (June 2009) table of contents
Article No. 5  
Year of Publication: 2009
ISSN:1553-3077
Authors
Mark W. Storer  University of California, Santa Cruz, CA
Kevin M. Greenan  University of California, Santa Cruz, CA
Ethan L. Miller  University of California, Santa Cruz, CA
Kaladhar Voruganti  NetApp, Sunnyvale, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 48,   Downloads (12 Months): 220,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1534912.1534914
What is a DOI?

ABSTRACT

Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public's desire to digitally record their personal histories. Unfortunately, many of the security mechanisms that modern systems rely upon, such as encryption, are poorly suited for storing data for indefinitely long periods of time; it is very difficult to manage keys and update cryptosystems to provide secrecy through encryption over periods of decades. Worse, an adversary who can compromise an archive need only wait for cryptanalysis techniques to catch up to the encryption algorithm used at the time of the compromise in order to obtain “secure” data. To address these concerns, we have developed POTSHARDS, an archival storage system that provides long-term security for data with very long lifetimes without using encryption. Secrecy is achieved by using unconditionally secure secret splitting and spreading the resulting shares across separately managed archives. Providing availability and data recovery in such a system can be difficult; thus, we use a new technique, approximate pointers, in conjunction with secure distributed RAID techniques to provide availability and reliability across independent archives. To validate our design, we developed a prototype POTSHARDS implementation. In addition to providing us with an experimental testbed, this prototype helped us to understand the design issues that must be addressed in order to maximize security.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
104th Congress. 1996. Health Information Portability and Accountability Act. http://www.hhs.gov/ocr/hipaa/.
2
3
 
4
 
5
 
6
 
7
Choi, S. J., Youn, H. Y., and Lee, B. K. 2003. An efficient dispersal and encryption scheme for secure distributed information storage. Lecture Notes in Computer Science, vol. 2660, 958--967.
 
8
 
9
CleverSafe. 2006. Highly secure, highly reliable, open source storage solution. http://www. cleversafe.org/.
 
10
11
 
12
 
13
14
 
15
 
16
 
17
Iyengar, A., Cahn, R., Garay, J. A., and Jutla, C. 1998. Design and implementation of a secure distributed data repository. In Proceedings of the 14th IFIP International Information Security Conference (SEC'98), 123--135.
 
18
 
19
20
 
21
22
 
23
 
24
Oxley, M. G. 2002. (H.R.3763) Sarbanes-Oxley Act of 2002.
 
25
 
26
27
 
28
 
29
Rivest, R. L. 1998. Chaffing and winnowing: Confidentiality without encryption. CryptoBytes, 4, 1, 12--17.
30
 
31
32
 
33
 
34
 
35
36
 
37
38
39
 
40
41
 
42
Wong, T. M., Wang, C., and Wing, J. M. 2002. Verifiable secret redistribution for threshold sharing schemes. Tech. rep. CMU-CS-02-114-R, Carnegie Mellon University. October.
 
43
44
 
45
46

Collaborative Colleagues:
Mark W. Storer: colleagues
Kevin M. Greenan: colleagues
Ethan L. Miller: colleagues
Kaladhar Voruganti: colleagues