Scalable secure storage when half the system is faulty

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 576-587

  Alon, Noga ^a   Kaplan, Haim ^a   Krivelevich, Michael ^a   Malkhi, Dahlia ^b   Stern, Julien ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BLOCK CODES; DIGITAL STORAGE; FAULT TOLERANT COMPUTER SYSTEMS;

ARBITRARY FAILURES; ASYMPTOTIC SPACE; D-REGULAR EXPANDER GRAPHS; ERROR CORRECTING CODE; ERROR PROBABILITIES; REPLICATED STORAGE; SECURE STORAGE; STORAGE SERVERS;

REED-SOLOMON CODES;

EID: 37049009792     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_49     Document Type: Conference Paper

References (23)

1. D. Agrawal and A. El Abbadi. Integrating security with fault-tolerant distributed databases. Computer Journal 33(1):71-78, February 1990.
2. N. Alon. Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. Combi- natorica 6(3):207-219, 1986.
3. N. Alon, U. Feige, A. Wigderson and D. Zuckerman. Derandomized graph products. Computational Complexity 5:60-75, 1995.
4. N. Alon and M. Luby. A linear time erasure-resilient code with nearly optimal recovery. IEEE Transactions on Information Theory 42:1732-1736, 1996.
5. N. Alon, J. Spencer and P. Erdos. The Probabilistic Method. John Wiley & Sons, Inc. 1992.
6. R. J. Anderson. The Eternity Service. In Proceedings of Pragocrypt’96, 1996.
7. B. Bollobàs. Random Graphs, Academic Press, London, 1985.
8. M. Castro and B. Liskov. Practical Byzantine fault tolerance. In the Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans, USA, February 1999.
9. J. Garay, R. Gennaro, C. Jutla and T. Rabin. Secure distributed storage and retrieval. In M. Mavronicolas and P. Tsigas, editors, 11th Internation Workshop on Distributed Algorithms, WDAG’97, pages 275-289, Berlin, 1997. (LNCS 1109).
10. O. Goldreich, R. Rubinfeld, and M. Sudan. Learning polynomials with queries: The highly noisy case. In Proc. 36th IEEE Symp on Foundations of Comp. Science, pages 294-303. IEEE, 1995.
11. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45(6):1757-1767, September 1999.
12. M. P. Herlihy and J. D. Tygar. How to make replicated data secure. In Advances in Cryptology—CRYPTO’87 Proceedings (Lecture Notes in Computer Science 293), pages 379-391, Springer-Verlag, 1988.
13. H. Krawczyk. Distributed fingerprints and secure information dispersal. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pages 207-218, 1993.
14. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocessor programs. IEEE Transactions on Computers, C-28(9):690-691, 1979.
15. A. Lubotzky, R. Phillips and P. Sarnak. Explicit expanders and the Ramanujan conjectures. In Proceedings of the 18th ACM Symposium on the Theory of Computing, pages 240-246, New York, 1986.
16. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman and V. Stemann. Practical loss-resilient codes. In Proceedings of the 29th Symposium on Theory of Computing, May 1997.
17. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large scale distributed systems. IEEE Transactions on Knowledge and Data Engineering, 12(2), 2000.
18. D. Mazières and M. F. Kaashoek. Escaping the evils of centralized control with self-certifying pathnames. In the Proceedings of the 8th ACM SIGOPS European workshop: Support for composing distributed applications, Sintra, Portugal, September 1998.
19. M. O. Rabin. Efficient dispersal of information for security, load balancing and fault tolerance. Journal of the ACM, 36(2):335-348, 1989.
20. R. M. Roth and G. Ruckenstern. Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Transactions on Information Theory, to appear.
21. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22(4):299-319, December 1990.
22. FIPS 180-1. Secure Hash Standard. NIST. US Dept. of Commerce, 1995.
23. M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.