{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T05:00:51Z","timestamp":1776229251182,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229626","type":"print"},{"value":"9783031229633","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22963-3_23","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"681-710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["State Machine Replication Under Changing Network Conditions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-1241","authenticated-orcid":false,"given":"Andreea B.","family":"Alexandru","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7497-7592","authenticated-orcid":false,"given":"Erica","family":"Blum","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7979-3810","authenticated-orcid":false,"given":"Julian","family":"Loss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of byzantine agreement, revisited. In: Robinson, P., Ellen, F. (eds.) 38th ACM PODC, pp. 317\u2013326. ACM, July 2019","DOI":"10.1145\/3293611.3331629"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-030-32101-7_20","volume-title":"Financial Cryptography and Data Security","author":"I Abraham","year":"2019","unstructured":"Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous byzantine agreement with expected O(1) rounds, expected $$O(n^2)$$ communication, and optimal resilience. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 320\u2013334. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_20"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Yin, M.: Sync HotStuff: simple and practical synchronous state machine replication. In: 2020 IEEE Symposium on Security and Privacy, pp. 106\u2013118. IEEE Computer Society Press, May 2020","DOI":"10.1109\/SP40000.2020.00044"},{"key":"23_CR4","unstructured":"Alexandru, A.B., Blum, E., Katz, J., Loss, J.: State machine replication under changing network conditions. Cryptology ePrint Archive, Report 2022\/698 (2022). https:\/\/eprint.iacr.org\/2022\/698"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Appan, A., Chandramouli, A., Choudhury, A.: Perfectly-secure synchronous MPC with asynchronous fallback guarantees. Cryptology ePrint Archive, Report 2022\/109 (2022). https:\/\/eprint.iacr.org\/2022\/109","DOI":"10.1145\/3519270.3538417"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-64375-1_10","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2020","unstructured":"Benhamouda, F., et al.: Can a public blockchain keep a secret? In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 260\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-36030-6_6","volume-title":"Theory of Cryptography","author":"E Blum","year":"2019","unstructured":"Blum, E., Katz, J., Loss, J.: Synchronous consensus with optimal asynchronous fallback guarantees. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 131\u2013150. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_6"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-030-92075-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"E Blum","year":"2021","unstructured":"Blum, E., Katz, J., Loss, J.: Tardigrade: an atomic broadcast protocol for arbitrary network conditions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 547\u2013572. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_19"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-030-56880-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Blum","year":"2020","unstructured":"Blum, E., Liu-Zhang, C.-D., Loss, J.: Always have a backup plan: fully secure synchronous\u00a0MPC\u00a0with\u00a0asynchronous\u00a0fallback. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 707\u2013731. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_25"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Atluri, V. (ed.) ACM CCS 2002, pp. 88\u201397. ACM Press, November 2002","DOI":"10.1145\/586110.586124"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Cachin, C., Poritz, J.A.: Secure intrusion-tolerant replication on the internet. In: Proceedings International Conference on Dependable Systems and Networks, pp. 167\u2013176. IEEE (2002)","DOI":"10.1109\/DSN.2002.1028897"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"R Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98\u2013116. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_7"},{"key":"23_CR13","unstructured":"Castro, M., Liskov, B.: Proactive recovery in a Byzantine-Fault-Tolerant system. In: 4th Symposium on Operating Systems Design and Implementation (2000)"},{"key":"23_CR14","unstructured":"Das, S., Xiang, Z., Ren, L.: Balanced quadratic reliable broadcast and improved asynchronous verifiable information dispersal. Cryptology ePrint Archive, Report 2022\/052 (2022). https:\/\/eprint.iacr.org\/2022\/052"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: BEAT: asynchronous BFT made practical. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 2028\u20132041. ACM Press, October 2018","DOI":"10.1145\/3243734.3243812"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-48000-6_15","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"Y Frankel","year":"1999","unstructured":"Frankel, Y., MacKenzie, P., Yung, M.: Adaptively-secure optimal-resilience proactive RSA. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 180\u2013194. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_15"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Ghinea, D., Liu-Zhang, C.-D., Wattenhofer, R.: Optimal synchronous approximate agreement with asynchronous fallback. Cryptology ePrint Archive, Report 2022\/354 (2022). https:\/\/eprint.iacr.org\/2022\/354","DOI":"10.1145\/3519270.3538442"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, New York, NY, USA, pp. 51\u201368. ACM (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ic.2013.11.003","volume":"234","author":"SD Gordon","year":"2014","unstructured":"Gordon, S.D., Katz, J., Kumaresan, R., Yerukhimovich, A.: Authenticated broadcast with a partially compromised public-key infrastructure. Inf. Comput. 234, 17\u201325 (2014)","journal-title":"Inf. Comput."},{"key":"23_CR20","unstructured":"Groth, J.: Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive, Report 2021\/339 (2021). https:\/\/eprint.iacr.org\/2021\/339"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous BFT protocols. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 803\u2013818. ACM Press, November 2020","DOI":"10.1145\/3372297.3417262"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"A Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339\u2013352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_27"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is DAG. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 165\u2013175 (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11523468_17","volume-title":"Automata, Languages and Programming","author":"K Kursawe","year":"2005","unstructured":"Kursawe, K., Shoup, V.: Optimistic asynchronous atomic broadcast. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 204\u2013215. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_17"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Liu, C., Duan, S., Zhang, H.: EPIC: efficient asynchronous BFT with adaptive security. In: International Conference on Dependable Systems and Networks (DSN), pp. 437\u2013451. IEEE (2020)","DOI":"10.1109\/DSN48063.2020.00058"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-MVBA: optimal multi-valued validated asynchronous byzantine agreement, revisited. In: Emek, Y., Cachin, C. (eds.) 39th ACM PODC, pp. 129\u2013138. ACM, August 2020","DOI":"10.1145\/3382734.3405707"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Maram, S.K.D., et al.: CHURP: dynamic-committee proactive secret sharing. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2369\u20132386. ACM Press, November 2019","DOI":"10.1145\/3319535.3363203"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 31\u201342. ACM Press, October 2016","DOI":"10.1145\/2976749.2978399"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Momose, A., Ren, L.: Multi-threshold byzantine fault tolerance. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1686\u20131699. ACM Press, November 2021","DOI":"10.1145\/3460120.3484554"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. In: 34th International Symposium on Distributed Computing. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)","DOI":"10.1007\/s00446-020-00384-1"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Logrippo, L. (ed.) 10th ACM PODC, pp. 51\u201359. ACM, August 1991","DOI":"10.1145\/112600.112605"},{"key":"23_CR32","unstructured":"Rambaud, M., Urban, A.: Asynchronous dynamic proactive secret sharing under honest majority: refreshing without a consistent view on shares. Cryptology ePrint Archive, Report 2022\/619 (2022). https:\/\/eprint.iacr.org\/2022\/619"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Schultz, D.A., Liskov, B., Liskov, M.: Mobile proactive secret sharing. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, p. 458 (2008)","DOI":"10.1145\/1400751.1400856"},{"key":"23_CR34","unstructured":"Shi, E.: Foundations of distributed consensus and blockchains. Book manuscript (2020)"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Vassantlal, R., Alchieri, E., Ferreira, B., Bessani, A.: Cobra: dynamic proactive secret sharing for confidential BFT services. In: Symposium on Security and Privacy (SP), pp. 1528\u20131528. IEEE Computer Society (2022)","DOI":"10.1109\/SP46214.2022.9833658"},{"key":"23_CR36","unstructured":"Yurek, T., Xiang, Z., Xia, Y., Miller, A.: Long live the honey badger: robust asynchronous DPSS and its applications. Cryptology ePrint Archive, Report 2022\/971 (2022). https:\/\/eprint.iacr.org\/2022\/971"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22963-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:03:18Z","timestamp":1769216598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22963-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229626","9783031229633"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22963-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"364","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":"98","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":"27% - 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","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":"10","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"}]}}