Scalable secure storage when half the system is faulty

Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien Stern

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Scopus citations

Abstract

In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the storage servers may incur arbitrary failures, including alterations to data stored in them. Using an error correcting code (ECC), e.g., a Reed-Solomon code, one can take n pieces of a document, replace each piece with another piece of size larger by a factor of n/n−2t such that it is possible to recover the original set even when up to t of the larger pieces are altered. For t close to n/2 the space overhead of this scheme is close to n, and an ECC such as the Reed-Solomon code degenerates to a trivial replication code. We show a technique to reduce this large space overhead for high values of t. Our scheme blows up each piece by a factor slightly larger than two using an erasure code which makes it possible to recover the original set using n/2−O(n/d) of the pieces, where d ≈ 80 is a fixed constant. Then we attach to each piece O(d log n/ log d) additional bits to make it possible to identify a large enough set of unmodified pieces, with negligible error probability, assuming that at least half the pieces are unmodified, and with low complexity. For values of t close to n/2 we achieve a large asymptotic space reduction over the best possible space blowup of any ECC in deterministic setting. Our approach makes use of a d-regular expander graph to compute the bits required for the identification of n/2 − O(n/d) good pieces.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings
EditorsUgo Montanari, Jose D. P. Rolim, Emo Welzl
PublisherSpringer Verlag
Pages576-587
Number of pages12
ISBN (Print)9783540450221
DOIs
StatePublished - 2000
Externally publishedYes
Event27th International Colloquium on Automata, Languages and Programming, ICALP 2000 - Geneva, Switzerland
Duration: Jul 9 2000Jul 15 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1853
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other27th International Colloquium on Automata, Languages and Programming, ICALP 2000
CountrySwitzerland
CityGeneva
Period7/9/007/15/00

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Scalable secure storage when half the system is faulty'. Together they form a unique fingerprint.

  • Cite this

    Alon, N., Kaplan, H., Krivelevich, M., Malkhi, D., & Stern, J. (2000). Scalable secure storage when half the system is faulty. In U. Montanari, J. D. P. Rolim, & E. Welzl (Eds.), Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings (pp. 576-587). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1853). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_49