{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:24:20Z","timestamp":1755998660142,"version":"3.32.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2005,11,17]],"date-time":"2005-11-17T00:00:00Z","timestamp":1132185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,11,17]],"date-time":"2005-11-17T00:00:00Z","timestamp":1132185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s00446-005-0151-6","type":"journal-article","created":{"date-parts":[[2005,11,10]],"date-time":"2005-11-10T14:57:36Z","timestamp":1131634656000},"page":"387-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["Byzantine disk paxos: optimal resilience with byzantine shared memory"],"prefix":"10.1007","volume":"18","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Chockler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,17]]},"reference":[{"key":"151_CR1","unstructured":"Attiya, H., Bar-Or, A.: Sharing memory with semibyzantine clients and faulty storage servers. In The 22nd Symposium on Reliable Distributed Systems (SRDS) (2003)"},{"issue":"6","key":"151_CR2","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1145\/227683.227688","volume":"42","author":"Y. Afek","year":"1995","unstructured":"Afek, Y., Greenberg, D.S., Merritt, M., Taubenfeld, G.: Computing with faulty shared objects. Journal of the ACM, 42(6), 1231\u20131274 (1995)","journal-title":"Journal of the ACM"},{"key":"151_CR3","first-page":"LNCS","volume":"Verlag","author":"Afek","year":"1993","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G.: Benign failures models for shared memory. In Proceedings of the 7th International Workshop on Distributed Algorithms, pages 69\u201383. Springer Verlag (1993) In: LNCS 725","journal-title":"Springer"},{"issue":"1","key":"151_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s004460050004","volume":"13","author":"R. Bazzi","year":"2000","unstructured":"Bazzi, R.: Synchronous byzantine quorum systems. Distributed Computing, 13(1), 45\u201352 (2000)","journal-title":"Distributed Computing"},{"issue":"1","key":"151_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/637437.637447","volume":"34","author":"R. Boichat","year":"2003","unstructured":"Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Deconstructing paxos. Distributed computing column of the ACM SIGACT News 34(1), 47\u201367 (2003)","journal-title":"Distributed computing column of the ACM SIGACT News"},{"issue":"4","key":"151_CR6","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G. Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4), 824\u2013840 (1985)","journal-title":"Journal of the ACM"},{"key":"151_CR7","doi-asserted-by":"crossref","unstructured":"Cristian, F., Fetzer, C.: The timed asynchronous distributed system model. IEEE Transactions on Parallel and Distributed Systems, pp. 642\u2013657 (1999)","DOI":"10.1109\/71.774912"},{"issue":"4","key":"151_CR8","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"key":"151_CR9","doi-asserted-by":"crossref","unstructured":"Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC\u201902) (2002)","DOI":"10.1145\/571825.571837"},{"key":"151_CR10","doi-asserted-by":"crossref","unstructured":"Chockler, G., Malkhi, D., Reiter, M.K.: Backoff protocols for distributed mutual exclusion and ordering. In Proceedings of the 21st International Conference on Distributed Computing Systems, pp. 11\u201320 (2001)","DOI":"10.1109\/ICDSC.2001.918928"},{"key":"151_CR11","unstructured":"Delporte, C., Fauconnier, H., Guerraoui, R.: Failure detection lower bounds on registers and consensus. In Proceedings of the 16th International Symposium on Distributed Computing (DISC) (2002)"},{"issue":"2","key":"151_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"1\u20132","key":"151_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(98)00263-1","volume":"243","author":"J.A. Garay","year":"2000","unstructured":"Garay, J.A., Gennaro, R., Jutla, C., Rabin, T.: Secure distributed storage and retrieval. Theoretical Computer Science 243(1\u20132), 363\u2013389 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"151_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-002-0070-8","volume":"16","author":"E. Gafni","year":"2003","unstructured":"Gafni, E., Lamport, L.: Disk paxos. Distributed Computing 16(1), 1\u201320 (2003)","journal-title":"Distributed Computing"},{"key":"151_CR15","doi-asserted-by":"crossref","unstructured":"Goodson, G., Wylie, J., Ganger, G., Reiter, M.: Efficient byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks (DSN-2004) (2004)","DOI":"10.1109\/DSN.2004.1311884"},{"key":"151_CR16","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), page 522, IEEE Computer Society (2003)"},{"issue":"1","key":"151_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/505241.505246","volume":"49","author":"S. Haldar","year":"2002","unstructured":"Haldar, S., Vitanyi, P.: Bounded concurrent timestamp systems using vector clocks. J. ACM 49(1), 101\u2013126 (2002)","journal-title":"J. ACM"},{"issue":"3","key":"151_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/278298.278305","volume":"45","author":"P. Jayanti","year":"1998","unstructured":"Jayanti, P., Chandra, T., Toueg, S.: Fault-tolerant wait-free shared objects. Journal of the ACM 45(3), 451\u2013500 (1998)","journal-title":"Journal of the ACM"},{"key":"151_CR19","doi-asserted-by":"crossref","unstructured":"Keidar, I., Rajsbaum, S.: On the cost of fault-tolerant consensus when there are no faults \u2013 a tutorial. Technical Report MIT-LCS-TR-821, MIT Laboratory for Computer Science May 2001. Preliminary version in SIGACT News 32(2), pp. 45\u201363 (2001) (published May 15th 2001)","DOI":"10.1145\/504192.504195"},{"issue":"2","key":"151_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication \u2013 part ii: Algorithms. Distributed Computing 1(2), 86\u2013101 (1986)","journal-title":"Distributed Computing"},{"issue":"2","key":"151_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems 16(2), 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"19","key":"151_CR22","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TPDS.2003.1233705","volume":"14","author":"S. Lakshmanan","year":"2003","unstructured":"Lakshmanan, S. Ahamad, M., Venkateswaran, H.: Responsive security for stored data. IEEE Trans. on Parallel and Distributed Systems 14(19), 818\u2013828 (2003)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"151_CR23","doi-asserted-by":"crossref","unstructured":"Lo, W.K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), pp. 280\u2013295. Springer-Verlag, (1994) In: LNCS 857","DOI":"10.1007\/BFb0020440"},{"key":"151_CR24","doi-asserted-by":"crossref","unstructured":"Lin, S., Chen, M., Lian, Q., Zhang, Z.: A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems. In 3rd International Workshop on Peer-to-Peer Systems (IPTPS\u201904) (2004)","DOI":"10.1007\/978-3-540-30183-7_2"},{"issue":"3","key":"151_CR25","first-page":"219","volume":"2","author":"N.A. Lynch","year":"1989","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to Input\/Output Automata. CWI Quarterly 2(3), 219\u2013246 (1989)","journal-title":"CWI Quarterly"},{"key":"151_CR26","doi-asserted-by":"crossref","unstructured":"Martin, J.-P., Alvisi, L. Dahlin, M.: Minimal byzantine storage. In Proceedings of the 16th International Symposium on Distributed Computing (DISC) (2002)","DOI":"10.1007\/3-540-36108-1_21"},{"issue":"4","key":"151_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing 11(4), 203\u2013213 (1998)","journal-title":"Distributed Computing"},{"issue":"2","key":"151_CR28","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/69.842262","volume":"12","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Reiter, M.: An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering 12(2), 187\u2013202 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"151_CR29","unstructured":"Rodrigues, R., Liskov, B.: Rosebud: A scalable Byzantine-Fault-Tolerant Storage Architecture. Technical Report MIT-LCS-TR-932, MIT Laboratory for Computer Science (2004)"},{"key":"151_CR30","doi-asserted-by":"crossref","unstructured":"Vitanyi, P., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In 27th IEEE Symp. Found. Comput. Sci., pp. 233\u2013243 (1986)","DOI":"10.1109\/SFCS.1986.11"},{"issue":"4","key":"151_CR31","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/571637.571638","volume":"20","author":"L. Zhou","year":"2002","unstructured":"Zhou, L., Schneider, F.B., van Renesse, R. Coca: A secure distributed on-line certification authority. ACM Transactions on Computer Systems 20(4), 329\u2013368 (2002)","journal-title":"ACM Transactions on Computer Systems"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0151-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-005-0151-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0151-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0151-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T12:17:14Z","timestamp":1736079434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-005-0151-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,17]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["151"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0151-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2005,11,17]]},"assertion":[{"value":"6 January 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2005","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}