An efficient dispersal and encryption scheme for secure distributed information storage

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Choi, S. J., Youn, H. Y., & Lee, B. K. (2003). An efficient dispersal and encryption scheme for secure distributed information storage. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2660, 958–967. https://doi.org/10.1007/3-540-44864-0_99

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free