{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T20:10:05Z","timestamp":1746389405877,"version":"3.40.4"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319117638"},{"type":"electronic","value":"9783319117645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11764-5_1","type":"book-chapter","created":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T22:53:32Z","timestamp":1411512812000},"page":"1-17","source":"Crossref","is-referenced-by-count":8,"title":["Separating Data and Control: Asynchronous BFT Storage with 2t\u2009+\u20091 Data Replicas"],"prefix":"10.1007","author":[{"given":"Christian","family":"Cachin","sequence":"first","affiliation":[]},{"given":"Dan","family":"Dobre","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Vukoli\u0107","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"1_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00446-005-0151-6","volume":"18","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk Paxos: Optimal resilience with Byzantine shared memory. Distributed Computing\u00a018(5), 387\u2013408 (2006)","journal-title":"Distributed Computing"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Adya, A., Bolosky, W.J., Castro, M., et al.: FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In: Proc. 5th Symp. Operating Systems Design and Implementation, OSDI (2002)","DOI":"10.1145\/1060289.1060291"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-75142-7_4","volume-title":"Distributed Computing","author":"A.S. Aiyer","year":"2007","unstructured":"Aiyer, A.S., Alvisi, L., Bazzi, R.A.: Bounded wait-free implementation of optimally resilient Byzantine storage without (unproven) cryptographic assumptions. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 7\u201319. Springer, Heidelberg (2007)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Androulaki, E., Cachin, C., Dobre, D., Vukoli\u0107, M.: Erasure-coded Byzantine storage with separate metadata. Report ArXiv:1402.4958, CoRR (2014)","DOI":"10.1007\/978-3-319-14472-6_6"},{"key":"1_CR5","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, London (1998)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cachin, C., Dobre, D., Vukoli\u0107, M.: BFT storage with 2t + 1 data replicas. Report ArXiv:1305.4868, CoRR (2013)","DOI":"10.1007\/978-3-319-11764-5_1"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C., Guerraoui, R., Rodrigues, L.: Introduction to Reliable and Secure Distributed Programming, 2nd edn. Springer (2011)","DOI":"10.1007\/978-3-642-15260-3"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Cachin, C., Junker, B., Sorniotti, A.: On limitations of using cloud storage for data replication. In: Proc. 6th Workshop on Recent Advances in Intrusion Tolerance and reSilience, WRAITS 2012 (2012)","DOI":"10.1109\/DSNW.2012.6264683"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded Byzantine distributed storage. In: Proc. International Conference on Dependable Systems and Networks (DSN-DCCS), pp. 115\u2013124 (2006)","DOI":"10.1109\/DSN.2006.56"},{"key":"1_CR10","unstructured":"Cho, B., Aguilera, M.K.: Surviving congestion in geo-distributed storage systems. In: Proc. USENIX Annual Technical Conference, pp. 439\u2013451 (2012)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Chun, B.-G., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: Making adversaries stick to their word. In: Proc. 21st ACM Symposium on Operating Systems Principles (SOSP), pp. 189\u2013204 (2007)","DOI":"10.1145\/1323293.1294280"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Correia, M., Neves, N.F., Ver\u00edssimo, P.: How to tolerate half less one Byzantine nodes in practical distributed systems. In: Proc. 23rd Symposium on Reliable Distributed Systems (SRDS), pp. 174\u2013183 (2004)","DOI":"10.1109\/RELDIS.2004.1353018"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Dobre, D., Karame, G., Li, W., Majuntke, M., Suri, N., Vukoli\u0107, M.: PoWerStore: Proofs of writing for efficient and robust storage. In: Proc. ACM Conference on Computer and Communications Security, CCS (2013)","DOI":"10.1145\/2508859.2516750"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Dobre, D., Viotti, P., Vukoli\u0107, M.: Hybris: Consistency hardening in robust hybrid cloud storage. Research Report RR-13-291, Eur\u00e9com (2013)","DOI":"10.1145\/2670979.2670991"},{"issue":"2","key":"1_CR15","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\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.A.: Efficient replication of large data objects. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 75\u201391. Springer, Heidelberg (2003)"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Vukoli\u0107, M.: How fast can a very robust read be? In: Proc. 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 248\u2013257 (2006)","DOI":"10.1145\/1146381.1146419"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-010-0103-7","volume":"23","author":"R. Guerraoui","year":"2010","unstructured":"Guerraoui, R., Vukoli\u0107, M.: Refined quorum systems. Distributed Computing\u00a023(1), 1\u201342 (2010)","journal-title":"Distributed Computing"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"11","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a011(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Kapitza, R., Behl, J., Cachin, C., Distler, T., Kuhnle, S., Mohammadi, S.V., Schr\u00f6der-Preikschat, W., Stengel, K.: CheapBFT: Resource-efficient Byzantine fault tolerance. In: Proc. 7th European Conference on Computer Systems (EuroSys), pp. 295\u2013308 (April 2012)","DOI":"10.1145\/2168836.2168866"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Chapman & Hall\/CRC (2007)","DOI":"10.1201\/9781420010756"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Lamport, L.: On interprocess communication. Distributed Computing\u00a01(2), 77\u201385, 86\u2013101 (1986)","DOI":"10.1007\/BF01786228"},{"issue":"2","key":"1_CR25","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\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"1_CR26","first-page":"51","volume":"32","author":"L. Lamport","year":"2001","unstructured":"Lamport, L.: Paxos made simple. SIGACT News\u00a032(4), 51\u201358 (2001)","journal-title":"SIGACT News"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-37795-6_4","volume-title":"Future Directions in Distributed Computing","author":"L. Lamport","year":"2003","unstructured":"Lamport, L.: Lower bounds for asynchronous consensus. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol.\u00a02584, pp. 22\u201323. Springer, Heidelberg (2003)"},{"key":"1_CR28","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"3","key":"1_CR29","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 Quaterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI Quaterly"},{"key":"1_CR30","unstructured":"Malkhi, D., Reiter, M.: Secure and scalable replication in Phalanx. In: Proc. 17th Symposium on Reliable Distributed Systems, SRDS (1998)"},{"issue":"4","key":"1_CR31","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.K.: Byzantine quorum systems. Distributed Computing\u00a011(4), 203\u2013213 (1998)","journal-title":"Distributed Computing"},{"key":"1_CR32","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":"1","key":"1_CR33","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"G.S. Veronese","year":"2011","unstructured":"Veronese, G.S., Correia, M., Bessani, A., Lung, L.C., Ver\u00edssimo, P.: Efficient Byzantine fault tolerance. IEEE Transactions on Computers\u00a062(1), 16\u201330 (2011)","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Vukoli\u0107, M.: Quorum Systems: With Applications to Storage and Consensus. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2012)","DOI":"10.2200\/S00402ED1V01Y201202DCT009"},{"key":"1_CR35","unstructured":"Wang, Y., Alvisi, L., Dahlin, M.: Gnothi: Separating data and metadata for efficient and available storage replication. In: Proc. USENIX Annual Technical Conference, pp. 413\u2013424 (2012)"},{"key":"1_CR36","unstructured":"Wilkes, J., Hoover, C., Keer, B., Mehra, P., Veitch, A.: Storage, Data, and Information Systems. HP Laboratories (2008)"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., Dahlin, M.: Separating agreement from execution for Byzantine fault-tolerant services. In: Proc. 19th ACM Symposium on Operating Systems Principles (SOSP), pp. 253\u2013268 (2003)","DOI":"10.1145\/1165389.945470"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11764-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T19:42:03Z","timestamp":1746387723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11764-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319117638","9783319117645"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11764-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}