{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:09:55Z","timestamp":1764886195374,"version":"3.46.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122896","type":"print"},{"value":"9783032122902","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"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-12290-2_22","type":"book-chapter","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:04Z","timestamp":1764886024000},"page":"675-708","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Unstoppable Ideal Functionality for\u00a0Signatures and\u00a0a\u00a0Modular Analysis of\u00a0the\u00a0Dolev-Strong Broadcast"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1293-552X","authenticated-orcid":false,"given":"Ran","family":"Cohen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0409-2132","authenticated-orcid":false,"given":"Jack","family":"Doerner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2860-2417","authenticated-orcid":false,"given":"Eysa","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-3550","authenticated-orcid":false,"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8436-0029","authenticated-orcid":false,"given":"Lawrence","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptol. 15(2), 103\u2013127 (2002)","journal-title":"J. Cryptol."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64381-2_1","volume-title":"Theory of Cryptography","author":"C Badertscher","year":"2020","unstructured":"Badertscher, C., Canetti, R., Hesse, J., Tackmann, B., Zikas, V.: Universal composition with global subroutines: capturing global setup within plain UC. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part III. LNCS, vol. 12552, pp. 1\u201330. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-30144-8_6","volume-title":"Information Security","author":"M Backes","year":"2004","unstructured":"Backes, M., Hofheinz, D.: How to break and repair a universally composable signature functionality. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 61\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30144-8_6"},{"key":"22_CR5","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, Part I. LNCS, vol. 11891, pp. 131\u2013150. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_6"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: 17th IEEE Computer Security Foundations Workshop, (CSFW), pp. 219\u2013233. IEEE Computer Society (2004)","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"22_CR8","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Version of December 2005 (2005). https:\/\/eccc.weizmann.ac.il\/eccc-reports\/2001\/TR01-016"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020)","DOI":"10.1145\/3402457"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-53015-3_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"R Cohen","year":"2016","unstructured":"Cohen, R., Coretti, S., Garay, J., Zikas, V.: Probabilistic termination and composability of cryptographic protocols. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part III. LNCS, vol. 9816, pp. 240\u2013269. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_9"},{"key":"22_CR11","unstructured":"Cohen, R., Doerner, J., Lee, E., Lysyanskaya, A., Roy, L.: An unstoppable ideal functionality for signatures and a modular analysis of the dolev-strong broadcast. Cryptology ePrint Archive, Report 2024\/1807 (2024)"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Cohen, R., Garay, J.A., Zikas, V.: Completeness theorems for adaptively secure broadcast. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 3\u201338. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_1","DOI":"10.1007\/978-3-031-38557-5_1"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00145-009-9055-0","volume":"24","author":"R Canetti","year":"2011","unstructured":"Canetti, R., Herzog, J.: Universally composable symbolic security analysis. J. Cryptol. 24(1), 83\u2013147 (2011)","journal-title":"J. Cryptol."},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R., Jain, P., Swanberg, M., Varia, M.: Universally composable end-to-end secure messaging. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 3\u201333. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_1","DOI":"10.1007\/978-3-031-15979-4_1"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-34618-8_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"J Camenisch","year":"2019","unstructured":"Camenisch, J., Krenn, S., K\u00fcsters, R., Rausch, D.: iUC: flexible universal composability made simple. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 191\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_7"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press (2002)","DOI":"10.1145\/509907.509980"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265\u2013281. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_16"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-49387-8_11","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Shahaf, D., Vald, M.: Universally composable authentication and key-exchange with global PKI. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016, Part II. LNCS, vol. 9615, pp. 265\u2013296. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_11"},{"issue":"6","key":"22_CR19","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A., Tyner, L.: Threshold BBS+ signatures for distributed anonymous credential issuance. In: 2023 IEEE Symposium on Security and Privacy, pp. 773\u2013789. IEEE Computer Society Press (2023)","DOI":"10.1109\/SP46215.2023.10179470"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Secure two-party threshold ECDSA from ECDSA assumptions. In: 2018 IEEE Symposium on Security and Privacy, pp. 980\u2013997. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00036"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA from ECDSA assumptions: the multiparty case. In: 2019 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (2019)","DOI":"10.1109\/SP.2019.00024"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA in three rounds. In: 2024 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (2024)","DOI":"10.1109\/SP54263.2024.00178"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"DeMillo, R.A., Lynch, N.A., Merritt, M.: Cryptographic protocols. In: 14th ACM STOC, pp. 383\u2013400. ACM Press (1982)","DOI":"10.1145\/800070.802214"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. In: Probert, R.L., Fischer, M.J., Santoro, N. (eds.) 1st ACM PODC, pp. 132\u2013140. ACM (1982)","DOI":"10.1145\/800220.806690"},{"issue":"4","key":"22_CR26","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."},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.C.-C.: On the security of public key protocols (extended abstract). In: 22nd FOCS, pp. 350\u2013357. IEEE Computer Society Press (1981)","DOI":"10.1109\/SFCS.1981.32"},{"key":"22_CR28","doi-asserted-by":"publisher","unstructured":"Elsheimy, F., Loss, J., Papamanthou, C.: Early stopping byzantine agreement in (1+$$\\epsilon $$ ) $$\\cdot $$ f rounds. In: Chung, K.-M., Sasaki, Y. (eds.) ASIACRYPT 2024, Part VI. LNCS, vol. 15489, pp. 398\u2013424. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_13","DOI":"10.1007\/978-981-96-0938-3_13"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: Borowsky, E., Rajsbaum, S. (eds.) 22nd ACM PODC, pp. 211\u2013220. ACM (2003)","DOI":"10.1145\/872035.872066"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Liu-Zhang, C.-D., Loss, J.: A new way to achieve round-efficient byzantine agreement. In: Miller, A., Censor-Hillel, K., Korhonen, J.H. (eds.) 40th ACM PODC, pp. 355\u2013362. ACM (2021)","DOI":"10.1145\/3465084.3467907"},{"issue":"1","key":"22_CR31","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"MJ Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986)","journal-title":"Distrib. Comput."},{"key":"22_CR32","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":"22_CR33","doi-asserted-by":"publisher","unstructured":"Ghinea, D., Goyal, V., Liu-Zhang, C.D.: Round-optimal byzantine agreement. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 96\u2013119. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_4","DOI":"10.1007\/978-3-031-06944-4_4"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Koo, C.-Y., Ostrovsky, R.: Round complexity of authenticated broadcast with a dishonest majority. In: 48th FOCS, pp. 658\u2013668. IEEE Computer Society Press (2007)","DOI":"10.1109\/FOCS.2007.44"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Kumaresan, R., Zhou, H.-S.: Adaptively secure broadcast, revisited. In: Gavoille, C., Fraigniaud, P. (eds.) 30th ACM PODC, pp. 179\u2013186. ACM (2011)","DOI":"10.1145\/1993806.1993832"},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Kiayias, A., Zhou, H.-S.: A framework for the sound specification of cryptographic tasks. In: Myers, A., Backes, M. (eds.) CSF 2010 Computer Security Foundations Symposium, pp. 277\u2013289. IEEE Computer Society Press (2010)","DOI":"10.1109\/CSF.2010.26"},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Ghinea, D., Liu-Zhang, C.-D., Wattenhofer, R.: Optimal synchronous approximate agreement with asynchronous fallback. In: Milani, A., Woelfel, P. (eds.) 41st ACM PODC, pp. 70\u201380. ACM (2022)","DOI":"10.1145\/3519270.3538442"},{"issue":"2","key":"22_CR38","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"22_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"22_CR41","unstructured":"Groth, J., Shoup, V.: Design and analysis of a distributed ECDSA signing service. IACR Cryptol. ePrint Arch. (2022). https:\/\/eprint.iacr.org\/2022\/506"},{"key":"22_CR42","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"},{"key":"22_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 445\u2013462. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_27"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press (2014)","DOI":"10.1201\/b17668"},{"key":"22_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"key":"22_CR46","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Tuengerthal, M.: Joint state theorems for public-key encryption and digital signature functionalities with local computation. In: Sabelfeld, A. (ed.) CSF 2008 Computer Security Foundations Symposium, pp. 270\u2013284. IEEE Computer Society Press (2008)","DOI":"10.1109\/CSF.2008.18"},{"key":"22_CR47","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 613\u2013644. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"22_CR48","unstructured":"Lindell, Y.: Lecture notes on foundations of cryptography (2017). https:\/\/yehudalindell.com\/wp-content\/uploads\/2023\/06\/main-89-856.pdf. Section 4.1, On the danger of induction arguments"},{"issue":"1","key":"22_CR49","first-page":"25","volume":"1","author":"Y Lindell","year":"2024","unstructured":"Lindell, Y.: Simple three-round multiparty Schnorr signing with full simulatability. Commun. Cryptol. 1(1), 25 (2024)","journal-title":"Commun. Cryptol."},{"key":"22_CR50","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Loss, J.: Optimal clock synchronization with signatures. In: Milani, A., Woelfel, P. (eds.) 41st ACM PODC, pp. 440\u2013449. ACM (2022)","DOI":"10.1145\/3519270.3538444"},{"key":"22_CR51","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: On the composition of authenticated byzantine agreement. In: 34th ACM STOC, pp. 514\u2013523. ACM Press (2002)","DOI":"10.1145\/509907.509982"},{"key":"22_CR52","doi-asserted-by":"publisher","unstructured":"Loss, J., Nielsen, J.B.: Early stopping for any number of corruptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14653, pp. 457\u2013488. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58734-4_16","DOI":"10.1007\/978-3-031-58734-4_16"},{"issue":"3","key":"22_CR53","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":"22_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11787006_7","volume-title":"Automata, Languages and Programming","author":"D Micciancio","year":"2006","unstructured":"Micciancio, D., Panjwani, S.: Corrupting one vs. corrupting many: the case of broadcast and multicast encryption. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol. 4052, pp. 70\u201382. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_7"},{"key":"22_CR55","unstructured":"Patil, A.: On symbolic analysis of cryptographic protocols. Ph.D. thesis, Massachusetts Institute of Technology (2005)"},{"issue":"2","key":"22_CR56","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"2","key":"22_CR57","first-page":"120","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. Assoc. Comput. Mach. 21(2), 120\u2013126 (1978)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"22_CR58","doi-asserted-by":"publisher","unstructured":"Tsimos, G., Loss, J., Papamanthou, C.: Gossiping for communication-efficient broadcast. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part III. LNCS, vol. 13509, pp. 439\u2013469. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_15","DOI":"10.1007\/978-3-031-15982-4_15"},{"key":"22_CR59","doi-asserted-by":"publisher","unstructured":"Wan, J., Xiao, H., Shi, E., Devadas, S.: Expected constant round byzantine broadcast under dishonest majority. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 381\u2013411. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_14","DOI":"10.1007\/978-3-030-64375-1_14"}],"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-032-12290-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:09Z","timestamp":1764886029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12290-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"ISBN":["9783032122896","9783032122902"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12290-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"5 December 2025","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}