{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T17:04:35Z","timestamp":1756573475596,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_14","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T23:30:06Z","timestamp":1507246206000},"page":"203-218","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Paxos Made Byzantine (and Less Complex)"],"prefix":"10.1007","author":[{"given":"Miguel","family":"Pires","sequence":"first","affiliation":[]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01784241","volume":"9","author":"M Ahamad","year":"1995","unstructured":"Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: definitions, implementation, and programming. Distrib. Comput. 9(1), 37\u201349 (1995)","journal-title":"Distrib. Comput."},{"unstructured":"Burrows, M.: The chubby lock service for loosely-coupled distributed systems. In: Proceedings of 7th Symposium on Operating Systems Design and Implementation (2006)","key":"14_CR2"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15260-3","volume-title":"Introduction to Reliable and Secure Distributed Programming","author":"C Cachin","year":"2011","unstructured":"Cachin, C., Guerraoui, R., Rodrigues, L.: Introduction to Reliable and Secure Distributed Programming, 2nd edn. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-15260-3","edition":"2"},{"unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of 3rd Symposium on Operating Systems Design and Implementation (OSDI) (1999)","key":"14_CR4"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0030679","volume-title":"Distributed Algorithms","author":"R Prisco De","year":"1997","unstructured":"De Prisco, R., Lampson, B., Lynch, N.A.: Revisiting the paxos algorithm. In: Mavronicolas, M., Tsigas, P. (eds.) WDAG 1997. LNCS, vol. 1320, pp. 111\u2013125. Springer, Heidelberg (1997). doi:\n10.1007\/BFb0030679"},{"doi-asserted-by":"crossref","unstructured":"DeCandia, G., et al.: Dynamo: Amazon\u2019s highly available key-value store. In: Proceedings of 21st Symposium on Operating Systems Principles (SOSP) (2007)","key":"14_CR6","DOI":"10.1145\/1294261.1294281"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Junqueira, F., Reed, B., Serafini, M.: Zab: high-performance broadcast for primary-backup systems. In: 41st International Conference on Dependable Systems and Networks (2011)","key":"14_CR8","DOI":"10.1109\/DSN.2011.5958223"},{"doi-asserted-by":"crossref","unstructured":"Ladin, R., Liskov, B., Shrira, L.: Lazy replication: exploiting the semantics of distributed services. In: Proceedings of 9th Symposium on Principles Distributed Computing (1990)","key":"14_CR9","DOI":"10.1145\/504136.504138"},{"unstructured":"Lamport, L.: The part-time parliament. Technical report, DEC SRC (1989)","key":"14_CR10"},{"issue":"2","key":"14_CR11","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 Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"14_CR12","first-page":"18","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport, L.: Paxos made simple. SIGACT News 32(4), 18\u201325 (2001)","journal-title":"SIGACT News"},{"unstructured":"Lamport, L.: Generalized consensus and paxos. Technical report, Technical Report MSR-TR-2005-33, Microsoft Research (2005)","key":"14_CR13"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00446-006-0005-x","volume":"19","author":"L Lamport","year":"2006","unstructured":"Lamport, L.: Fast paxos. Distrib. Comput. 19(2), 79\u2013103 (2006)","journal-title":"Distrib. Comput."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-24100-0_22","volume-title":"Distributed Computing","author":"L Lamport","year":"2011","unstructured":"Lamport, L.: Byzantizing paxos by refinement. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 211\u2013224. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-24100-0_22"},{"issue":"3","key":"14_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. Progr. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Lee, E.K., Thekkath, C.A.: Petal: distributed virtual disks. In: Proceedings of 7th International Conference on Architectural Support for Programming Languages and Operating Systems (1996)","key":"14_CR17","DOI":"10.1145\/237090.237157"},{"unstructured":"Li, C., Porto, D., Clement, A., Gehrke, J., Pregui\u00e7a, N., Rodrigues, R.: Making geo-replicated systems fast as possible, consistent when necessary. In: Proceedings of 10th Symposium on Operating Systems Design and Implementation (OSDI) (2012)","key":"14_CR18"},{"unstructured":"Mao, Y., Junqueira, F.P., Marzullo, K.: Mencius: building efficient replicated state machines for WANs. In: Proceedings of 8th Symposium on Operating Systems Design and Implementation (OSDI) (2008)","key":"14_CR19"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"JP Martin","year":"2006","unstructured":"Martin, J.P., Alvisi, L.: Fast byzantine consensus. IEEE Trans. Dependable Secur. Comput. 3(3), 202\u2013215 (2006)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"doi-asserted-by":"crossref","unstructured":"Moraru, I., Andersen, D.G., Kaminsky, M.: There is more consensus in Egalitarian parliaments. In: Proceedings of Symposium on Operating Systems Principles (SOSP) (2013)","key":"14_CR21","DOI":"10.1145\/2517349.2517350"},{"unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)","key":"14_CR22"},{"key":"14_CR23","first-page":"203","volume-title":"Lecture Notes in Computer Science","author":"Miguel Pires","year":"2017","unstructured":"Pires, M., Ravi, S., Rodrigues, R.: Generalized Paxos Made Byzantine (and Less Complex). Tech. rep. (2017)"},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2673577","volume":"47","author":"R Renesse van","year":"2011","unstructured":"van Renesse, R.: Paxos made moderately complex. ACM Comput. Surv. 47(3), 1\u201336 (2011)","journal-title":"ACM Comput. Surv."},{"unstructured":"Singh, A., Fonseca, P., Kuznetsov, P.: Zeno: eventually consistent byzantine-fault tolerance. In: Proceedings of 6th Symposium on Networked Systems Design and Implementation (NSDI) (2009)","key":"14_CR25"},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00402ED1V01Y201202DCT009","volume":"3","author":"Marko Vukoli\u0107","year":"2012","unstructured":"Vukolic, M.: Quorum systems: with applications to storage and consensus. In: Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool (2012)","journal-title":"Synthesis Lectures on Distributed Computing Theory"}],"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-69084-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T08:11:02Z","timestamp":1531296662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}