Survivable information storage systems

Wylie, Jay J.; Bigrigg, Michael W.; Strunk, John D.; Ganger, Gregory R.; Kiliççöte, Han; Khosla, Pradeep K.

doi:10.1109/2.863969

Cited by 147 publications

(83 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this paper, we will refer to this ubiquitous form of clusters as a flat cluster (Figure 1). Examples of such systems exist in both research [4,24,9] and commercial [10,1] settings.…”

Section: Conventional Approachmentioning

confidence: 99%

A Fault-Tolerant Middleware Architecture for High-Availability Storage Services

Seshadri

Liu

Cooper

et al. 2007

IEEE International Conference on Services Computing (SCC 2007)

View full text Add to dashboard Cite

show abstract

“…In this paper, we will refer to this ubiquitous form of clusters as a flat cluster (Figure 1). Examples of such systems exist in both research [4,24,9] and commercial [10,1] settings.…”

Section: Conventional Approachmentioning

confidence: 99%

A Fault-Tolerant Middleware Architecture for High-Availability Storage Services

Seshadri

Liu

Cooper

et al. 2007

IEEE International Conference on Services Computing (SCC 2007)

View full text Add to dashboard Cite

show abstract

“…(d) Rabin's information dispersal algorithm (1-m-n) offers a range of storage solutions that show trade-off between availability and required storage space. Like decimation, it does not offer confidentiality [6]. The threshold schemes can be used instead of cryptographic techniques to guarantee the confidentiality, and multiple schemes can be combined.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Dispersal and Encryption Scheme for Secure Distributed Information Storage

Choi

Youn

Lee

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Digital information is a critical resource, creating a need for distributed storage systems that provide sufficient data availability and security in the face of failures and malicious attacks. However, the requirements for achieving high availability and security with distributed storage systems usually conflict with each other. This paper proposes a novel data dispersal/encryption scheme improving both the availability and security of distributed storage system by using some important properties of matrices. It also allows complete recovery of original data even though they are partially damaged. Analysis shows it improves the availability about 15% compared with an efficient existing scheme for both read and write operation, while it allows secure storage simultaneously.

show abstract

“…Secret sharing improves the security guarantees by forcing an adversary to breach multiple archival sites to obtain meaningful information about the data. Several recently proposed archival systems such as POTSHARDS [22], PASIS [25,7], and GridSharing [23] employ secret sharing schemes for this reason.…”

Section: Long Term Data Confidentialitymentioning

confidence: 99%

“…The right choice of these parameters depends on several factors, including expected workload, system component characteristics, and the desired levels of availability and security. PASIS [25,7,24] proposes analytic techniques to ascertain the right secret sharing parameters for a given system. FlexArchive builds upon the insights provided by this body of work for determining appropriate values for these parameters.…”

Section: Re-configuration In Flexarchive: Key Concernsmentioning

confidence: 99%

Middleware for a Re-configurable Distributed Archival Store Based on Secret Sharing

et al. 2010

View full text Add to dashboard Cite

-Modern storage systems are often faced with complex trade-offs between the confidentiality, availability, and performance they offer their users. Secret sharing is a data encoding technique that provides information-theoretically provable guarantees on confidentiality unlike conventional encryption. Additionally, secret sharing provides quantifiable guarantees on the availability of the encoded data. We argue that these properties make secret sharing-based encoding of data particularly suitable for the design of increasingly popular and important distributed archival data stores. These guarantees, however, come at the cost of increased resource consumption during reads/writes. Consequently, it is desirable that such a storage system employ techniques that could dynamically transform data representation to operate the store within required confidentiality, availability, and performance regimes (or budgets) despite changes to the operating environment. Since state-of-the-art transformation techniques suffer from prohibitive data transfer overheads, we develop a middleware for dynamic data transformation. Using this, we propose the design and operation of a secure, available, and tunable distributed archival store called FlexArchive. Using a combination of analysis and empirical evaluation, we demonstrate the feasibility of our archival store. In particular, we demonstrate that FlexArchive can achieve dynamic data re-configurations in significantly lower times (factor of 50 or more) without any sacrifice in confidentiality and with a negligible loss in availability (less than 1%).

show abstract

Survivable information storage systems

Cited by 147 publications

References 13 publications

A Fault-Tolerant Middleware Architecture for High-Availability Storage Services

A Fault-Tolerant Middleware Architecture for High-Availability Storage Services

An Efficient Dispersal and Encryption Scheme for Secure Distributed Information Storage

Middleware for a Re-configurable Distributed Archival Store Based on Secret Sharing

Contact Info

Product

Resources

About