{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:00:19Z","timestamp":1786978819483,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030360290","type":"print"},{"value":"9783030360306","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36030-6_6","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T12:02:36Z","timestamp":1574424156000},"page":"131-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Synchronous Consensus with Optimal Asynchronous Fallback Guarantees"],"prefix":"10.1007","author":[{"given":"Erica","family":"Blum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience. In: 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 405\u2013414. ACM Press (2008)","DOI":"10.1145\/1400751.1400804"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Yin, M.: Sync HotStuff: simple and practical synchronous state machine replication (2019). http:\/\/eprint.iacr.org\/2019\/270","DOI":"10.1109\/SP40000.2020.00044"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M., Nielsen, J.B.: On the theoretical gap between synchronous and asynchronous MPC protocols. In: 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 211\u2013218. ACM Press (2010)","DOI":"10.1145\/1835698.1835746"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople: practical asynchronous Byzantine agreement using cryptography. J. Cryptology 18(3), 219\u2013246 (2005)","journal-title":"J. Cryptology"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous Byzantine agreement with optimal resilience. In: 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42\u201351. ACM Press (1993)","DOI":"10.1145\/167088.167105"},{"issue":"4","key":"6_CR6","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 Trans. Comput. Syst. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160\u2013179. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_10"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR10","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.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-39200-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"M Fitzi","year":"2003","unstructured":"Fitzi, M., Hirt, M., Holenstein, T., Wullschleger, J.: Two-threshold broadcast and detectable multi-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 51\u201367. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_4"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-04355-0_46","volume-title":"Distributed Computing","author":"M Fitzi","year":"2009","unstructured":"Fitzi, M., Nielsen, J.B.: On the number of synchronous rounds sufficient for authenticated byzantine agreement. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 449\u2013463. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04355-0_46"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Kumaresan, R., Zhou, H.-S.: Adaptively secure broadcast, revisited. In: 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 179\u2013186. ACM Press (2011)","DOI":"10.1145\/1993806.1993832"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling Byzantine agreements for cryptocurrencies (2017). http:\/\/eprint.iacr.org\/2017\/454","DOI":"10.1145\/3132747.3132757"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S Goldwasser","year":"2005","unstructured":"Goldwasser, S., Lindell, Y.: Secure multi-party computation without agreement. J. Cryptology 18(3), 247\u2013287 (2005)","journal-title":"J. Cryptology"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-26948-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"Y Guo","year":"2019","unstructured":"Guo, Y., Pass, R., Shi, E.: Synchronous, with a chance of partition tolerance. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 499\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_18"},{"key":"6_CR17","unstructured":"Hanke, T., Movahedi, M., Williams, D.: Dfinity technology overview series consensus system, rev. 1 (2018). https:\/\/dfinity.org\/faq"},{"key":"6_CR18","unstructured":"Heilman, E., Kendler, A., Zohar, A., Goldberg, S.: Eclipse attacks on Bitcoin\u2019s peer-to-peer network. In: 24th USENIX Security Symposium, pp. 129\u2013144. USENIX Association (2015)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-13190-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Hirt","year":"2010","unstructured":"Hirt, M., Zikas, V.: Adaptively secure broadcast. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 466\u2013485. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_24"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2008.08.001","volume":"75","author":"J Katz","year":"2009","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for Byzantine agreement. J. Comput. Syst. Sci. 75(2), 91\u2013112 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/1658357.1658358","volume":"27","author":"R Kotla","year":"2009","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative Byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4), 7:1\u20137:39 (2009)","journal-title":"ACM Trans. Comput. Syst."},{"key":"6_CR22","unstructured":"Kursawe, K.: Optimistic Byzantine agreement. In: 21st Symposium on Reliable Distributed Systems (SRDS), pp. 262\u2013267. IEEE Computer Society (2002)"},{"key":"6_CR23","unstructured":"Lamport, L.: The part-time parliament. Technical Report 49, DEC Systems Research Center (1989)"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR25","unstructured":"Liu, S., Viotti, P., Cachin, C., Qu\u00e9ma, V., Vukolic, M.: XFT: practical fault tolerance beyond crashes. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 485\u2013500. USENIX Association (2016)"},{"key":"6_CR26","unstructured":"Liu-Zhang, C.-D., Loss, J., Moran, T., Maurer, U., Tschudi, D.: Robust MPC: asynchronous responsiveness yet synchronous security (2019). http:\/\/eprint.iacr.org\/2019\/159"},{"key":"6_CR27","unstructured":"Loss, J., Moran, T.: Combining asynchronous and synchronous Byzantine agreement: the best of both worlds (2018). http:\/\/eprint.iacr.org\/2018\/235"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Nayak, K., Ren, L.: Flexible Byzantine fault tolerance (2019). https:\/\/arxiv.org\/abs\/1904.10067","DOI":"10.1145\/3319535.3354225"},{"issue":"4","key":"6_CR29","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1145\/2785953","volume":"62","author":"A Most\u00e9faoui","year":"2015","unstructured":"Most\u00e9faoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous binary Byzantine consensus with $$t<n\/3$$, $$O(n^2)$$ messages, and $$O(1)$$ expected time. J. ACM 62(4), 31:1\u201331:21 (2015)","journal-title":"J. ACM"},{"key":"6_CR30","unstructured":"Ongaro, D., Ousterhout, J.K.: In search of an understandable consensus algorithm. In: USENIX Annual Technical Conference, pp. 305\u2013319. USENIX Association (2014)"},{"key":"6_CR31","unstructured":"Pass, R., Shi, E.: Hybrid consensus: efficient consensus in the permissionless model. In: 31st International Symposium on Distributed Computing (DISC), volume 91 of LIPIcs, pp. 39:1\u201339:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2017)"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78375-8_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"R Pass","year":"2018","unstructured":"Pass, R., Shi, E.: Thunderella: blockchains with optimistic instant confirmation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_1"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Pandu Rangan, C.: Simple and efficient asynchronous byzantine agreement with optimal resilience. In: 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 92\u2013101. ACM Press (2009)","DOI":"10.1145\/1582716.1582736"},{"issue":"6","key":"6_CR34","doi-asserted-by":"publisher","first-page":"4207","DOI":"10.1109\/TIT.2018.2827360","volume":"64","author":"A Patra","year":"2018","unstructured":"Patra, A., Ravi, D.: On the power of hybrid networks in multi-party computation. IEEE Trans. Inf. Theory 64(6), 4207\u20134227 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"6_CR35","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Toueg, S.: Randomized Byzantine agreements. In: 3rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 163\u2013178. ACM Press (1984)","DOI":"10.1145\/800222.806744"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36030-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T22:07:50Z","timestamp":1669068470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-36030-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030360290","9783030360306"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36030-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nuremberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Review software by Shai Halevi","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"147","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.35","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}