Scalable Secure Storage When Half the System Is Faulty
- 1 May 2002
- journal article
- Published by Elsevier in Information and Computation
- Vol. 174 (2) , 203-213
- https://doi.org/10.1006/inco.2002.3148
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient decoding of Reed-Solomon codes beyond half the minimum distanceIEEE Transactions on Information Theory, 2000
- An architecture for survivable coordination in large distributed systemsIEEE Transactions on Knowledge and Data Engineering, 2000
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- A linear time erasure-resilient code with nearly optimal recoveryIEEE Transactions on Information Theory, 1996
- Derandomized graph productscomputational complexity, 1995
- Highly resilient correctors for polynomialsInformation Processing Letters, 1992
- Integrating Security with Fault-tolerant Distributed DatabasesThe Computer Journal, 1990
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- Eigenvalues, geometric expanders, sorting in rounds, and ramsey theoryCombinatorica, 1986