{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T21:49:18Z","timestamp":1790718558757,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540751410","type":"print"},{"value":"9783540751427","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_4","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T10:00:46Z","timestamp":1188986446000},"page":"7-19","source":"Crossref","is-referenced-by-count":11,"title":["Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions"],"prefix":"10.1007","author":[{"given":"Amitanand S.","family":"Aiyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Alvisi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rida A.","family":"Bazzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aiyer, A., Alvisi, L., Bazzi, R.A.: Bounded Wait-free Implementation of Optimally Resilient Byzantine Storage without (Unproven) Cryptographic Assumptions. Technical Report TR-07-32, University of Texas at Austin, Department of Computer Sciences (July 2007)","DOI":"10.1145\/1281100.1281147"},{"key":"4_CR2","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":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11864219_21","volume-title":"Distributed Computing","author":"R.A. Bazzi","year":"2006","unstructured":"Bazzi, R.A., Ding, Y.: Bounded wait-free f-resilient atomic byzantine data storage systems for an unbounded number of clients. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 299\u2013313. Springer, Heidelberg (2006)"},{"key":"4_CR4","first-page":"115","volume-title":"DSN","author":"C. Cachin","year":"2006","unstructured":"Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage. In: DSN, Washington, DC, USA, pp. 115\u2013124. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-540-39989-6_6","volume-title":"Distributed Computing","author":"R. Fan","year":"2003","unstructured":"Fan, R., Lynch, N.: Efficient replication of large data objects. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 75\u201391. Springer, Heidelberg (2003)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Vukolic, M.: Refined Quorum Systems. Technical Report LPD-REPORT-2007-001, EPFL (2007)","DOI":"10.1145\/1281100.1281120"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. part i: Basic formalism. Distributed Computing\u00a01(2), 77\u2013101 (1986)","journal-title":"Distributed Computing"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","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, pp. 311\u2013325. Springer, Heidelberg (2005)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","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, pp. 311\u2013325. Springer, Heidelberg (2002)"},{"issue":"2","key":"4_CR11","first-page":"133","volume":"1","author":"M. Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol.\u00a01(2), 133\u2013138 (1988)","journal-title":"J. Cryptol."}],"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_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:52:51Z","timestamp":1619506371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}