{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:23:13Z","timestamp":1742916193212,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319151465"},{"type":"electronic","value":"9783319151472"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15147-2_27","type":"book-chapter","created":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T14:46:02Z","timestamp":1426776362000},"page":"321-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Byzantine Fault Tolerance"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Zbierski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,20]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TDSC.2004.2","volume":"1","author":"A Avizienis","year":"2004","unstructured":"Avizienis, A., Laprie, J.-C., Randell, B., Landwehr, C.: Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Secur. Comput. 1(1), 11\u201333 (2004)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"27_CR2","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI\u201999. USENIX Association, Berkeley, pp. 173\u2013186 (1999)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chun, B.-C., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. In: Proceedings of the 21st Symposium on Operating Systems Principles (2007)","DOI":"10.1145\/1294261.1294280"},{"key":"27_CR4","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: Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems, pp. 174\u2013183, October 2004","DOI":"10.1109\/RELDIS.2004.1353018"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Distler, T., Kapitza, R.: Increasing performance in Byzantine fault-tolerant systems with on-demand replica consistency. In: Proceedings of the EuroSys 2011 Conference (EuroSys\u201911), pp. 91\u2013105 (2011)","DOI":"10.1145\/1966445.1966455"},{"key":"27_CR6","unstructured":"Distler, T., Kapitza, R., Popov, I., Reiser, H.P., Schr\u00f6der-Preikschat, W.: SPARE: replicas on hold. In: Proceedings of the 18th Network and Distributed System Security Symposium (NDSS \u201911), pp. 407\u2013420, (2011)"},{"key":"27_CR7","unstructured":"Gawkowski, P., Sosnowski, J.: Dependability evaluation with fault injection experiments. IEICE Trans. Inf. Syst. E86-D(12), 2642\u20132649 (2003)"},{"key":"27_CR8","unstructured":"Google. App engine outage today, p. 6 (2008). https:\/\/groups.google.com\/forum\/?fromgroups=#!topic\/google-appengine\/985VmzuLMDs"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Hendricks, J., Sinnamohideen, S., Ganger, G.R., Reiter, M.K.: Zzyzx: Scalable fault tolerance through byzantine locking. In: 2010 IEEE\/IFIP International Conference on, Dependable Systems and Networks (DSN), pp. 363\u2013372 (2010)","DOI":"10.1109\/DSN.2010.5544297"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/1044956.1044959","volume":"1","author":"AC Huang","year":"2005","unstructured":"Huang, A.C., Fox, A.: Cheap recovery: a key to self-managing state. ACM Trans. Storage 1(1), 38\u201370 (2005)","journal-title":"ACM Trans. Storage"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Knight, J.: Fundamentals of Dependable Computing for Software Engineers. Boca Raton, CRC Press, (2012)","DOI":"10.1201\/b11667"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Kotla, R., Clement, A., Wong, E., Alvisi, L., Dahlin, M.: Zyzzyva: speculative Byzantine fault tolerance. In: Symposium on Operating Systems Principles (SOSP) (2007)","DOI":"10.1145\/1294261.1294267"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Kotla, R., Dahlin, M.: High throughput Byzantine fault tolerance. In: Proceedings of the 2004 Conference on Dependable Systems and Networks, pp. 575\u2013584 (2004)","DOI":"10.1109\/DSN.2004.1311928"},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1145\/138873.138877","volume":"10","author":"R Ladin","year":"1992","unstructured":"Ladin, R., Liskov, B., Shrira, L., Ghemawat, S.: Providing high availability using lazy replication. ACM Trans. Comput. Syst. 10(4), 360\u2013391 (1992)","journal-title":"ACM Trans. Comput. Syst."},{"key":"27_CR15","unstructured":"Lamport, L.: From Byzantine generals to hackers, p. 5 (2011), http:\/\/www.college-de-france.fr\/site\/martin-abadi\/seminar-2011-05-11-11h00-resume.htm"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Progra. Lang. Syst. 4, 382\u2013401 (1982)","journal-title":"ACM Trans. Progra. Lang. Syst."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shrira, L.: Replication in the Harp file system. In: Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles, SOSP \u201991, pp. 226\u2013238, ACM. New York (1991)","DOI":"10.1145\/121132.121169"},{"key":"27_CR18","unstructured":"Osier, M.: Shipping delay recap, p. 8 (2008), http:\/\/blog.netflix.com\/2008\/08\/shipping-delay-recap.html"},{"key":"27_CR19","unstructured":"P\u00e2ris, J.-F.: Voting with witnesses: a consistency scheme for replicated files. In: Proceedings of the 6th International Conference on Distributed Computing Systems, pp. 3\u20136 (1986)"},{"issue":"6","key":"27_CR20","first-page":"981","volume":"18","author":"P Urb\u00e1n","year":"2002","unstructured":"Urb\u00e1n, P., D\u00e9fago, X., Schiper, A.: Neko: A single environment to simulate and prototype distributed algorithms. J. Inf. Sci. Eng. 18(6), 981\u2013997 (2002)","journal-title":"J. Inf. Sci. Eng."},{"key":"27_CR21","unstructured":"Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C., Verissimo, P., Efficient Byzantine fault tolerance. IEEE Trans. Comput. p. 99 (2011)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Wood, T., Singh, R., Venkataramani, A., Shenoy, P., Cecchet, E.: ZZ and the art of practical BTF execution. In: Proceedings of the sixth conference on Computer systems, EuroSys\u201911, pp. 123\u2013138 (2011)","DOI":"10.1145\/1966445.1966457"},{"key":"27_CR23","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: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, pp. 253\u2013267, ACM Press (2003)","DOI":"10.1145\/1165389.945470"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Zbierski, M., Iwazaru: The Byzantine sequencer. In: Proceedings of the 26th International Conference on Architecture of Computing Systems, pp. 38\u201349 (2013)","DOI":"10.1007\/978-3-642-36424-2_4"}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing in Computer and Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15147-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T22:55:37Z","timestamp":1676588137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15147-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319151465","9783319151472"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15147-2_27","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}