{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T16:46:08Z","timestamp":1792946768706,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108761","type":"print"},{"value":"9783642108778","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_24","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T07:11:04Z","timestamp":1259737864000},"page":"300-314","source":"Crossref","is-referenced-by-count":11,"title":["Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency"],"prefix":"10.1007","author":[{"given":"Zarko","family":"Milosevic","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Hutle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"Schiper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","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"},{"issue":"3","key":"24_CR2","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. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing\u00a02(2), 80\u201394 (1987)","journal-title":"Distributed Computing"},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"J.P. Martin","year":"2006","unstructured":"Martin, J.P., Alvisi, L.: Fast byzantine consensus. Transactions on Dependable and Secure Computing\u00a03(3), 202\u2013214 (2006)","journal-title":"Transactions on Dependable and Secure Computing"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: The weak byzantine generals problem. J. ACM\u00a030(3), 668\u2013676 (1983)","journal-title":"J. ACM"},{"key":"24_CR6","unstructured":"Doudou, A., Guerraoui, R., Garbinato, B.: Abstractions for devising byzantine-resilient state machine replication. In: SRDS (2000)"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M. Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems\u00a020(4), 398\u2013461 (2002)","journal-title":"ACM Transactions on Computer Systems"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Milosevic, Z., Hutle, M., Schiper, A.: Unifying byzantine consensus algorithms with weak interactive consistency (LSR-REPORT-2009-003)","DOI":"10.1007\/978-3-642-10877-8_24"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger, G., Toueg, S.: Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms\u00a011(3), 374\u2013419 (1990)","journal-title":"J. Algorithms"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/383962.383969","volume-title":"PODC","author":"B. Lampson","year":"2001","unstructured":"Lampson, B.: The abcd\u2019s of paxos. In: PODC, p. 13. ACM Press, New York (2001)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-87779-0_2","volume-title":"Distributed Computing","author":"A.S. Aiyer","year":"2008","unstructured":"Aiyer, A.S., Alvisi, L., Bazzi, R.A., Clement, A.: Matrix signatures: From mACs to digital signatures in distributed systems. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 16\u201331. Springer, Heidelberg (2008)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Consensus with byzantine failures and little system synchrony. In: DSN, pp. 147\u2013155 (2006)","DOI":"10.1109\/DSN.2006.22"},{"key":"24_CR14","first-page":"27","volume-title":"PODC","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: PODC, pp. 27\u201329. ACM, New York (1983)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Correia, M., Neves, N.F., Lung, L.C., Ver\u00edssimo, P.: Low complexity byzantine-resilient consensus. Distributed Computing\u00a017(3) (2005)","DOI":"10.1007\/s00446-004-0110-7"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative byzantine fault tolerance. In: SOSP, pp. 45\u201358 (2007)","DOI":"10.1145\/1323293.1294267"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-87779-0_30","volume-title":"Distributed Computing","author":"Y.J. Song","year":"2008","unstructured":"Song, Y.J., van Renesse, R.: Bosco: One-step byzantine asynchronous consensus. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 438\u2013450. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T15:31:07Z","timestamp":1739460667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}