{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:56:03Z","timestamp":1742972163272,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609376"},{"type":"electronic","value":"9789819609383"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0938-3_13","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:22:29Z","timestamp":1733941349000},"page":"398-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Early Stopping Byzantine Agreement in\u00a0$$(1+\\epsilon ) \\cdot f$$ Rounds"],"prefix":"10.1007","author":[{"given":"Fatima","family":"Elsheimy","sequence":"first","affiliation":[]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Chan, T.H.H., Dolev, D., Nayak, K., Pass, R., Ren, L., Shi, E.: Communication complexity of byzantine agreement, revisited (2020)","DOI":"10.1145\/3293611.3331629"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I., Dolev, D.: Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing. p. 605-614. STOC \u201915, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2746539.2746581","DOI":"10.1145\/2746539.2746581"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Alpturer, K., Halpern, J.Y., van\u00a0der Meyden, R.: Optimal eventual byzantine agreement protocols with omission failures. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. p. 244-252. PODC \u201923, Association for Computing Machinery, New York, NY, USA (2023).https:\/\/doi.org\/10.1145\/3583668.3594573","DOI":"10.1145\/3583668.3594573"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. Computer Science pp. 313\u2013321 (1992)","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography. Cryptology ePrint Archive, Paper 2000\/034 (2000), https:\/\/eprint.iacr.org\/2000\/034","DOI":"10.1145\/343477.343531"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5) (sep 2020), https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Moses, Y., Raynal, M., Roy, M.: Early decision and stopping in synchronous consensus: a predicate-based guided tour. In: International Conference on Networked Systems. pp. 206\u2013221. Springer (2017)","DOI":"10.1007\/978-3-319-59647-1_16"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in byzantine agreement. J. ACM 37(4), 720-741 (oct 1990). https:\/\/doi.org\/10.1145\/96559.96565","DOI":"10.1145\/96559.96565"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Dolev, D., Strong, H.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12, 656\u2013666 (11 1983). https:\/\/doi.org\/10.1137\/0212045","DOI":"10.1137\/0212045"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. p. 148-161. STOC \u201988, Association for Computing Machinery, New York, NY, USA (1988). https:\/\/doi.org\/10.1145\/62212.62225","DOI":"10.1145\/62212.62225"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Fitzi, M., Nielsen, J.: On the number of synchronous rounds sufficient for authenticated byzantine agreement. In: Distributed Computing. pp. 449\u2013463. Springer Berlin Heidelberg, Berlin, Heidelberg (09 2009).https:\/\/doi.org\/10.1007\/978-3-642-04355-0_46","DOI":"10.1007\/978-3-642-04355-0_46"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Fitzi, M., Maurer, U.: From partial consistency to global broadcast. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing. p. 494-503. STOC \u201900, Association for Computing Machinery, New York, NY, USA (2000). https:\/\/doi.org\/10.1145\/335305.335363","DOI":"10.1145\/335305.335363"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Garay, Moses, Y.: Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds. SIAM Journal on Computing 27(1), 247\u2013290 (1998).https:\/\/doi.org\/10.1137\/S0097539794265232","DOI":"10.1137\/S0097539794265232"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement in t + 1 rounds. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing. p. 31-41. STOC \u201993, Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/167088.167101","DOI":"10.1145\/167088.167101"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Petrank, E.: The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocols. Information Processing Letters 36(1), 45\u201349 (1990).https:\/\/doi.org\/10.1016\/0020-0190(90)90185-Z","DOI":"10.1016\/0020-0190(90)90185-Z"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Katz, J., Koo, C.Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) Advances in Cryptology - CRYPTO 2006. pp. 445\u2013462. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)","DOI":"10.1007\/11818175_27"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382-401 (jul 1982).https:\/\/doi.org\/10.1145\/357172.357176","DOI":"10.1145\/357172.357176"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Loss, J., Nielsen, J.B.: Early stopping for any number of corruptions. In: Advances in Cryptology - EUROCRYPT 2024: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, May 26-30, 2024, Proceedings, Part III. p. 457-488. Springer-Verlag, Berlin, Heidelberg (2024).https:\/\/doi.org\/10.1007\/978-3-031-58734-4_16","DOI":"10.1007\/978-3-031-58734-4_16"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Micali, S.: Very simple and efficient byzantine agreement. In: Papadimitriou, C.H. (ed.) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA. LIPIcs, vol.\u00a067, pp. 6:1\u20136:1. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017).https:\/\/doi.org\/10.4230\/LIPICS.ITCS.2017.6","DOI":"10.4230\/LIPICS.ITCS.2017.6"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Parv\u00e9dy, P.R., Raynal, M.: Optimal early stopping uniform consensus in synchronous systems with process omission failures. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. p. 302-310. SPAA \u201904, Association for Computing Machinery, New York, NY, USA (2004). https:\/\/doi.org\/10.1145\/1007912.1007963","DOI":"10.1145\/1007912.1007963"},{"key":"13_CR21","unstructured":"Perry, K., Toueg, S.: An authenticated byzantine generals algorithm with early stopping. Cornell eCommons (1984), online"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Wan, J., Xiao, H., Devadas, S., Shi, E.: Round-efficient byzantine broadcast under strongly adaptive and majority corruptions. In: Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part I. p. 412-456. Springer-Verlag, Berlin, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_15","DOI":"10.1007\/978-3-030-64375-1_15"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Zamsky, A.: An randomized byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing. p. 201-208. PODC \u201996, Association for Computing Machinery, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/248052.248091","DOI":"10.1145\/248052.248091"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0938-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:30:35Z","timestamp":1733945435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}