Scalable Secure Storage when Half the System Is Faulty
- 1 January 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 576-587
- https://doi.org/10.1007/3-540-45022-x_49
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Secure distributed storage and retrievalPublished by Springer Nature ,1997
- A linear time erasure-resilient code with nearly optimal recoveryIEEE Transactions on Information Theory, 1996
- Derandomized graph productscomputational complexity, 1995
- Distributed fingerprints and secure information dispersalPublished by Association for Computing Machinery (ACM) ,1993
- Integrating Security with Fault-tolerant Distributed DatabasesThe Computer Journal, 1990
- How to Make Replicated Data SecureLecture Notes in Computer Science, 1988
- Eigenvalues, geometric expanders, sorting in rounds, and ramsey theoryCombinatorica, 1986
- Explicit expanders and the Ramanujan conjecturesPublished by Association for Computing Machinery (ACM) ,1986
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979