Survivable storage systems

Survivable storage systems must maintain data and access to it in the face of malicious and accidental problems with storage servers, interconnection networks, client systems and user accounts. These four component types can be grouped into two classes: server-side problems and client-side problems. The PASIS architecture addresses server-side problems, including the connections to those servers, by encoding data with threshold schemes and distributing trust amongst sets of storage servers. Self-securing storage addresses client and user account problems by transparently auditing accesses and versioning data within each storage server. Thus, PASIS clients use threshold schemes to protect themselves from compromised servers, and self-securing servers use full access auditing to protect their data from compromised clients. Together, these techniques can provide truly survivable storage systems.

[1]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[2]  Yves Deswarte,et al.  Intrusion tolerance in distributed computing systems , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[3]  Douglas R. Stinson,et al.  Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.

[4]  Dorothy E. Denning,et al.  An Intrusion-Detection Model , 1986, 1986 IEEE Symposium on Security and Privacy.

[5]  Robert S. Cahn,et al.  Design and Implementation of a Secure Distributed Data Repository , 1998 .

[6]  Craig A. N. Soules,et al.  Design and Implementation of a Self-Securing Storage Device , 2000 .

[7]  Joshua P. MacDonald,et al.  File System Support for Delta Compression , 2000 .

[8]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[9]  R. Anderson.  The Eternity Service , 1996 .

[10]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[11]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[12]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[13]  Marc Unangst,et al.  NASD Scalable Storage Systems , 1999 .

[14]  Randal C. Burns.  DIFFERENTIAL COMPRESSION: A GENERALIZED SOLUTION FOR BINARY FILES , 1996 .

[15]  Norman C. Hutchinson,et al.  Elephant: the file system that never forgets , 1999, Proceedings of the Seventh Workshop on Hot Topics in Operating Systems.

[16]  Chandramohan A. Thekkath,et al.  Petal: distributed virtual disks , 1996, ASPLOS VII.

[17]  Hugo Krawczyk,et al.  Secret Sharing Made Short , 1994, CRYPTO.

[18]  Alfredo De Santis,et al.  Multiple ramp schemes , 1999, IEEE Trans. Inf. Theory.

[19]  Mahadev Satyanarayanan,et al.  An empirical study of a wide-area distributed file system , 1996, TOCS.

[20]  Butler W. Lampson,et al.  On-line data compression in a log-structured file system , 1992, ASPLOS V.

[21]  Michael K. Reiter,et al.  Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.

[22]  Eugene H. Spafford,et al.  The design and implementation of tripwire: a file system integrity checker , 1994, CCS '94.

[23]  Robert B. Hagmann,et al.  Reimplementing the Cedar file system using logging and group commit , 1987, SOSP '87.

[24]  Pradeep K. Khosla,et al.  Survivable Information Storage Systems , 2000, Computer.

[25]  W. Vogels.  File system usage in Windows NT 4.0 , 2000, OPSR.

[26]  Andrew V. Goldberg,et al.  A prototype implementation of archival Intermemory , 1999, DL '99.

[27]  Kirby McCoy.  VMS File System Internals , 1990 .

[28]  Norman C. Hutchinson,et al.  Deciding when to forget in the Elephant file system , 1999, SOSP.

[29]  Jeanna Neefe Matthews,et al.  Improving the performance of log-structured file systems with adaptive methods , 1997, SOSP.

[30]  Jeanna Neefe Matthews,et al.  Serverless network file systems , 1996, TOCS.