{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:10:27Z","timestamp":1763467827359},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_13","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"139-151","source":"Crossref","is-referenced-by-count":5,"title":["Amnesic Distributed Storage"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Chockler","sequence":"first","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Private communication (2002)"},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00446-005-0151-6","volume":"18","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine Disk Paxos: Optimal resilience with byzantine shared memory. Distributed Computing\u00a018(5), 387\u2013408 (2004)","journal-title":"Distributed Computing"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2006.07.012","volume":"101","author":"I. Abraham","year":"2007","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Wait-free regular storage from byzantine components. Information Processing Letters (IPL)\u00a0101(2), 60\u201365 (2007)","journal-title":"Information Processing Letters (IPL)"},{"issue":"6","key":"13_CR4","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\u00a042(6), 1231\u20131274 (1995)","journal-title":"Journal of the ACM"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-57271-6_28","volume-title":"Distributed Algorithms","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G.: Benign failures models for shared memory. In: Schiper, A. (ed.) Distributed Algorithms. LNCS, vol.\u00a0725, pp. 69\u201383. Springer, Heidelberg (1993)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. Journal of the ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"Journal of the ACM"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/978-3-540-30186-8_29","volume-title":"Distributed Computing","author":"R.A. Bazzi","year":"2004","unstructured":"Bazzi, R.A., Ding, Y.: Non-skipping Timestamps for Byzantine Data Storage Systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 405\u2013419. Springer, Heidelberg (2004)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded Byzantine distributed storage. In: DSN 2006. Intl. Conference on Dependable Systems and Networks, pp. 115\u2013124 (June 2006)","DOI":"10.1109\/DSN.2006.56"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Goodson, G., Wylie, J., Ganger, G., Reiter, M.: Efficient byzantine-tolerant erasure-coded storage. Technical Report CMU-PDL-03-104, Parallel Data Laboratory, CMU (December 2003)","DOI":"10.1109\/DSN.2004.1311884"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Goodson, G., Wylie, J., Ganger, G., Reiter, M.: Efficient byzantine-tolerant erasure-coded storage. In: DSN-2004. The International Conference on Dependable Systems and Networks (June 2004)","DOI":"10.1109\/DSN.2004.1311884"},{"key":"13_CR11","first-page":"125","volume-title":"DSN","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Levy, R.R., Vukolic, M.: Lucky read\/write access to robust atomic storage. In: DSN, pp. 125\u2013136. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"13_CR12","volume-title":"PODC 2006","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Vukoli\u0107, M.: How Fast Can a Very Robust Read Be? In: PODC 2006. 25th ACM Symposium on Principles of Distributed Computing, ACM Press, New York (2006)"},{"issue":"3","key":"13_CR13","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\u00a045(3), 451\u2013500 (1998)","journal-title":"Journal of the ACM"},{"issue":"19","key":"13_CR14","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\u00a014(19), 818\u2013828 (2003)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"2","key":"13_CR15","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\u00a01(2), 86\u2013101 (1986)","journal-title":"Distributed Computing"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_35","volume-title":"Distributed Computing","author":"B. Liskov","year":"2005","unstructured":"Liskov, B., Rodrigues, R.: Byzantine clients rendered harmless. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, Springer, Heidelberg (2005)"},{"issue":"4","key":"13_CR17","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\u00a011(4), 203\u2013213 (1998)","journal-title":"Distributed Computing"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36108-1_21","volume-title":"Distributed Computing","author":"J.-P. Martin","year":"2002","unstructured":"Martin, J.-P., Alvisi, L., Dahlin, M.: Minimal byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, Springer, Heidelberg (2002)"},{"key":"13_CR19","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)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:34Z","timestamp":1619520754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}