{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:17:08Z","timestamp":1770992228680,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540677154","type":"print"},{"value":"9783540450221","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_49","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T23:57:25Z","timestamp":1194998245000},"page":"576-587","source":"Crossref","is-referenced-by-count":21,"title":["Scalable Secure Storage when Half the System Is Faulty"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Krivelevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Stern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"issue":"1","key":"49_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1093\/comjnl\/33.1.71","volume":"33","author":"D. Agrawal","year":"1990","unstructured":"D. Agrawal and A. El Abbadi. Integrating security with fault-tolerant distributed databases. Computer Journal 33(1):71\u201378, February 1990.","journal-title":"Computer Journal"},{"issue":"3","key":"49_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02579382","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon. Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. Combinatorica 6(3):207\u2013219, 1986.","journal-title":"Combinatorica"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01277956","volume":"5","author":"N. Alon","year":"1995","unstructured":"N. Alon, U. Feige, A. Wigderson and D. Zuckerman. Derandomized graph products. Computational Complexity 5:60\u201375, 1995.","journal-title":"Computational Complexity"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1109\/18.556669","volume":"42","author":"N. Alon","year":"1996","unstructured":"N. Alon and M. Luby. A linear time erasure-resilient code with nearly optimal recovery. IEEE Transactions on Information Theory 42:1732\u20131736, 1996.","journal-title":"IEEE Transactions on Information Theory"},{"key":"49_CR5","unstructured":"N. Alon, J. Spencer and P. Erdos. The Probabilistic Method. John Wiley & Sons, Inc. 1992."},{"key":"49_CR6","unstructured":"R. J. Anderson. The Eternity Service. In Proceedings of Pragocrypt\u2019 96, 1996."},{"key":"49_CR7","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s. Random Graphs, Academic Press, London, 1985."},{"key":"49_CR8","unstructured":"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."},{"key":"49_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BFb0030690","volume-title":"11th Internation Workshop on Distributed Algorithms, WDAG\u2019 97","author":"J. Garay","year":"1997","unstructured":"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\u2019 97, pages 275\u2013289, Berlin, 1997. (LNCS 1109)."},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013303. IEEE, 1995.","DOI":"10.1109\/SFCS.1995.492485"},{"issue":"6","key":"49_CR11","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45(6):1757\u20131767, September 1999.","journal-title":"IEEE Transactions on Information Theory"},{"key":"49_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-48184-2_33","volume-title":"Advances in Cryptology-CRYPTO\u2019 87 Proceedings","author":"M. P. Herlihy","year":"1988","unstructured":"M. P. Herlihy and J. D. Tygar. How to make replicated data secure. In Advances in Cryptology-CRYPTO\u2019 87 Proceedings (Lecture Notes in Computer Science 293), pages 379\u2013391, Springer-Verlag, 1988."},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"H. Krawczyk. Distributed fingerprints and secure information dispersal. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pages 207\u2013218, 1993.","DOI":"10.1145\/164051.164075"},{"issue":"9","key":"49_CR14","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"L. Lamport. How to make a multiprocessor computer that correctly executes multiprocessor programs. IEEE Transactions on Computers, C-28(9):690\u2013691, 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013246, New York, 1986.","DOI":"10.1145\/12130.12154"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/258533.258573"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/69.842262"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"D. Mazi\u00e9res 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.","DOI":"10.1145\/319195.319213"},{"issue":"2","key":"49_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M. O. Rabin","year":"1989","unstructured":"M. O. Rabin. Efficient dispersal of information for security, load balancing and fault tolerance. Journal of the ACM, 36(2):335\u2013348, 1989.","journal-title":"Journal of the ACM"},{"key":"49_CR20","unstructured":"R. M. Roth and G. Ruckenstern. Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Transactions on Information Theory, to appear."},{"issue":"4","key":"49_CR21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F. B. Schneider","year":"1990","unstructured":"F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22(4):299\u2013319, December 1990.","journal-title":"ACM Computing Surveys"},{"key":"49_CR22","unstructured":"FIPS 180-1. Secure Hash Standard. NIST. Us Dept. of Commerce, 1995."},{"issue":"1","key":"49_CR23","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180\u2013193, 1997.","journal-title":"Journal of Complexity"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45022-X_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:02:53Z","timestamp":1737536573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_49","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}