Scalable secure storage when half the system is faulty

DOI10.1006/INCO.2002.3148MaRDI QIDQ1854529zbMATH OpenOpenAlexFDO

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

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/569d4baa5b21b29b25cd14ae21e691ccbf7eed0f

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• scientific article; zbMATH DE number 1670854
• Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213]
• Fail-aware untrusted storage
• Toward Optimal Secure Distributed Storage Systems With Exact Repair
• Fault-Tolerant Storage in a Dynamic Environment
• Computational Science - ICCS 2004
• Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty
• A cost effective fault-tolerant scheme for RAIDs
• Efficient and modular consensus-free reconfiguration for fault-tolerant storage
• The Rate Region for Secure Distributed Storage Systems

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 1306862 (Why is no real title available?)
• scientific article; zbMATH DE number 1061188 (Why is no real title available?)
• scientific article; zbMATH DE number 1559530 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• A linear time erasure-resilient code with nearly optimal recovery
• Decoding of Reed Solomon codes beyond the error-correction bound
• Derandomized graph products
• Distributed fingerprints and secure information dispersal
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Highly resilient correctors for polynomials
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Secure distributed storage and retrieval
• Tolerating a linear number of faults in networks of bounded degree

Cited in

(6)

• Stability for 1-intersecting families of perfect matchings
• Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213]
• Sparse random erasure code: a fault tolerance scheme for large-scale storage system
• Vertex percolation on expander graphs
• Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty
• scientific article; zbMATH DE number 1670854 (Why is no real title available?)

This page was built for publication: Scalable secure storage when half the system is faulty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854529)