Scalable secure storage when half the system is faulty

DOI10.1006/inco.2002.3148zbMath1009.68039OpenAlexW2048114999MaRDI QIDQ1854529

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

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) Information storage and retrieval of data (68P20)

Related Items (3)

Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213] ⋮ Stability for 1-intersecting families of perfect matchings ⋮ Vertex percolation on expander graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Highly resilient correctors for polynomials
• Tolerating a linear number of faults in networks of bounded degree
• Decoding of Reed Solomon codes beyond the error-correction bound
• Secure distributed storage and retrieval
• Derandomized graph products
• A linear time erasure-resilient code with nearly optimal recovery
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• Distributed fingerprints and secure information dispersal

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