{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,26]],"date-time":"2026-10-26T17:46:54Z","timestamp":1793036814199,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540000730","type":"print"},{"value":"9783540361084","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36108-1_21","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:38:36Z","timestamp":1178224716000},"page":"311-325","source":"Crossref","is-referenced-by-count":61,"title":["Minimal Byzantine Storage"],"prefix":"10.1007","author":[{"given":"Jean-Philippe","family":"Martin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Alvisi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Dahlin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"L. Alvisi, D. Malkhi, E. Pierce, and R. Wright. Dynamic Byzantine quorum systems. In Proceedings of the International Conference on Dependable Systems and Networks, June 2000.","DOI":"10.1109\/ICDSN.2000.857551"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message passing systems. Journal of the ACM (JACM) Volume 42, pages 124\u2013142, 1995.","journal-title":"Journal of the ACM (JACM)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"R. A. Bazzi. Synchronous Byzantine quorum systems. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pages 259\u2013266, 1997.","DOI":"10.1145\/259380.259454"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/PL00008925","volume":"14","author":"R. A. Bazzi","year":"2001","unstructured":"R. A. Bazzi. Access cost for asynchronous Byzantine quorum systems. Distributed Computing Journal volume 14, Issue 1, pages 41\u201348, January 2001.","journal-title":"Distributed Computing Journal"},{"key":"21_CR5","unstructured":"M. Castro and NB. Liskov. Practical Byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI\u201999), New Orleans, USA, pages 173\u2013186, February 1999."},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/5505.5508","volume":"17","author":"S. Davidson","year":"1985","unstructured":"S. Davidson, H. Garcia-Molina, and D. Skeen. Consistency in a partitioned network: a survey. ACM Computing Surveys (CSUR) Volume 17, Issue 3, pages 341\u2013370, September 1985.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Technical Report MIT\/LCS\/TR-282, 1982.","DOI":"10.1145\/588059.588060"},{"key":"21_CR8","unstructured":"E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns. Addison Wesley, October 1994. ISBN 0-201-63361-2."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"L. Lamport. On interprocess communications. Distributed Computing, pages 77\u2013101, 1986.","DOI":"10.1007\/BF01786227"},{"issue":"7","key":"21_CR10","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"Leslie Lamport","year":"1978","unstructured":"Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558\u2013565, July 1978.","journal-title":"Communications of the ACM"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"D. Malkhi and M. Reiter. Byzantine quorum systems. Distributed Computing, pages 203\u2013213, 1998.","DOI":"10.1007\/s004460050050"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"D. Malkhi and M. Reiter. Secure and scalable replication in phalanx. In Proc. 17th IEEE Symposium on Reliable Distributed Systems, West Lafayette, Indiana, USA, Oct 1998.","DOI":"10.1109\/RELDIS.1998.740474"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"D. Malkhi, M. Reiter, and A. Wool. The load and availability of Byzantine quorum systems. In Proceedings 16th ACM Symposium on Principles of Distributed Computing (PODC), pages 249\u2013257, August 1997.","DOI":"10.1145\/259380.259450"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. Technical Report TR-02-38, University of Texas at Austin, Department of Computer Sciences, August 2002.","DOI":"10.1007\/3-540-36108-1_21"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"J-P. Martin, L. Alvisi, and M. Dahlin. Small Byzantine quorum systems.In Proceedings of the International Conference on Dependable Systems and Networks, pages 374\u2013383, June 2002.","DOI":"10.1109\/DSN.2002.1028922"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0097539795281232","volume":"27","author":"M. Naor","year":"1998","unstructured":"M. Naor and A. Wool. The load, capacity, and availability of quorum systems. SI AM Journal on Computing, 27(2):423\u2013447, 1998.","journal-title":"SI AM Journal on Computing"},{"key":"21_CR17","unstructured":"E. Pierce and L. Alvisi. A recipe for atomic semantics for Byzantine quorum systems. Technical report, University of Texas at Austin, Department of Computer Sciences, May 2000."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"R. Rodrigues, M. Castro, and B. Liskov. BASE: Using abstraction to improve fault tolerance. In Proceedings of the 18th Symposium on Operating Systems Principles (SOSP\u2019 01), October 2001.","DOI":"10.1145\/502034.502037"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36108-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:17:43Z","timestamp":1556374663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36108-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000730","9783540361084"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-36108-1_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}