{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:12:31Z","timestamp":1778022751806,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253231","type":"print"},{"value":"9783032253248","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-25324-8_14","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:42:28Z","timestamp":1778020948000},"page":"397-426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Good-Case Latency for\u00a0Sleepy Consensus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0882-9342","authenticated-orcid":false,"given":"Yuval","family":"Efron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9777-6168","authenticated-orcid":false,"given":"Joachim","family":"Neu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3437-7570","authenticated-orcid":false,"given":"Ling","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6061-9700","authenticated-orcid":false,"given":"Ertem Nusret","family":"Tas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Nayak, K., Ren, L., Xiang, Z.: Good-case latency of Byzantine broadcast: a complete categorization. In: PODC, pp. 331\u2013341. ACM (2021)","DOI":"10.1145\/3465084.3467899"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Gazi, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros Genesis: composable proof-of-stake blockchains with dynamic availability. In: CCS, pp. 913\u2013930. ACM (2018)","DOI":"10.1145\/3243734.3243848"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Civit, P., Gilbert, S., Guerraoui, R., Komatovic, J., Paramonov, A., Vidigueira, M.: All Byzantine agreement problems are expensive. In: PODC, pp. 157\u2013169. ACM (2024)","DOI":"10.1145\/3662158.3662780"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"D\u2019Amato, F., Losa, G., Zanolini, L.: Asynchrony-resilient sleepy total-order broadcast protocols. In: PODC, pp. 247\u2013256. ACM (2024)","DOI":"10.1145\/3662158.3662779"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"D\u2019Amato, F., Neu, J., Tas, E.N., Tse, D.: Goldfish: No more attacks on Ethereum?! In: FC (1). Lecture Notes in Computer Science, vol. 14744, pp. 3\u201323. Springer (2024)","DOI":"10.1007\/978-3-031-78676-1_1"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"D\u2019Amato, F., Saltini, R., Tran, T., Zanolini, L.: TOB-SVD: total-order broadcast with single-vote decisions in the sleepy model. In: ICDCS, pp. 1033\u20131043. IEEE (2025)","DOI":"10.1109\/ICDCS63083.2025.00104"},{"key":"14_CR7","unstructured":"Efron, Y., Neu, J., Pitassi, T.: Fully-fluctuating participation in sleepy consensus. In: AFT. LIPIcs, vol.\u00a0354, pp. 17:1\u201317:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"14_CR8","unstructured":"Efron, Y., Tas, E.N.: Dynamically available common subset. Cryptology ePrint Archive, Paper 2025\/016 (2025). https:\/\/eprint.iacr.org\/2025\/016"},{"key":"14_CR9","unstructured":"Gafni, E., Losa, G.: Brief announcement: Byzantine consensus under dynamic participation with a well-behaved majority. In: DISC. LIPIcs, vol.\u00a0281, pp. 41:1\u201341:7. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-319-63688-7_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Garay","year":"2017","unstructured":"Garay, J., Ishai, Y., Ostrovsky, R., Zikas, V.: The price of low communication in secure multi-party computation. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 420\u2013446. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_14"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Kiayias, A., Leonardos, N.: The Bitcoin backbone protocol: analysis and applications. J. ACM 71(4), 25:1\u201325:49 (2024)","DOI":"10.1145\/3653445"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.A.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002)","journal-title":"SIGACT News"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-662-64331-0_4","volume-title":"Financial Cryptography and Data Security","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Li, H., Raizes, J.: Instant block confirmation in the sleepy model. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 65\u201383. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_4"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Khanchandani, P., Wattenhofer, R.: Byzantine agreement with unknown participants and failures. In: IPDPS, pp. 952\u2013961. IEEE (2021)","DOI":"10.1109\/IPDPS49936.2021.00104"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"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.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":"14_CR17","unstructured":"Lewis-Pye, A., Roughgarden, T.: Permissionless consensus. arXiv:2304.14701v5 (2023). http:\/\/arxiv.org\/abs\/2304.14701v5"},{"key":"14_CR18","unstructured":"Losa, G., Gafni, E.: Consensus in the unknown-participation message-adversary model. arXiv:2301.04817v2 (2023). http:\/\/arxiv.org\/abs\/2301.04817v2"},{"key":"14_CR19","unstructured":"Malkhi, D., Momose, A., Ren, L.: Byzantine consensus under fully fluctuating participation. Cryptology ePrint Archive, Paper 2022\/1448, Version 20221024:011919 (2022). https:\/\/eprint.iacr.org\/archive\/2022\/1448\/20221024:011919"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Momose, A., Ren, L.: Towards practical sleepy BFT. In: CCS, pp. 490\u2013503. ACM (2023)","DOI":"10.1145\/3576915.3623073"},{"key":"14_CR21","unstructured":"Momose, A., Ren, L.: Optimal communication complexity of authenticated Byzantine agreement. In: DISC. LIPIcs, vol.\u00a0209, pp. 32:1\u201332:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Momose, A., Ren, L.: Constant latency in sleepy consensus. In: CCS, pp. 2295\u20132308. ACM (2022)","DOI":"10.1145\/3548606.3559347"},{"key":"14_CR23","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: Ebb-and-flow protocols: a resolution of the availability-finality dilemma. In: SP, pp. 446\u2013465. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00045"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-70697-9_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Shi, E.: The sleepy model of consensus. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 380\u2013409. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_14"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Sridhar, S., Tas, E.N., Neu, J., Zindros, D., Tse, D.: Consensus under adversary majority done right. In: FC (2). Lecture Notes in Computer Science, vol. 15752, pp. 108\u2013126. Springer (2025)","DOI":"10.1007\/978-3-032-07035-7_7"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Wan, J., Xiao, H., Shi, E., Devadas, S.: Expected constant round Byzantine broadcast under dishonest majority. J. ACM 72(4), 30:1\u201330:39 (2025)","DOI":"10.1145\/3748254"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25324-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:42:36Z","timestamp":1778020956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25324-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253231","9783032253248"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25324-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}