{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:18:57Z","timestamp":1755796737238,"version":"3.44.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018779"},{"type":"electronic","value":"9783032018786"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-3-032-01878-6_1","type":"book-chapter","created":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T09:20:33Z","timestamp":1755508833000},"page":"3-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["State Machine Replication Among Strangers, Fast and\u00a0Self-sufficient"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0366-7110","authenticated-orcid":false,"given":"Juan","family":"Garay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-1430","authenticated-orcid":false,"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4316-8116","authenticated-orcid":false,"given":"Yu","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","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, San Francisco, CA, USA, 18\u201321 May 2020, pp. 106\u2013118. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00044","DOI":"10.1109\/SP40000.2020.00044"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Gazi, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) 25th Conference on Computer and Communications Security, ACM CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 913\u2013930. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243848","DOI":"10.1145\/3243734.3243848"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-030-77883-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Badertscher","year":"2021","unstructured":"Badertscher, C., Ga\u017ei, P., Kiayias, A., Russell, A., Zikas, V.: Dynamic ad hoc clock synchronization. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 399\u2013428. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_14"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-63688-7_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Badertscher","year":"2017","unstructured":"Badertscher, C., Maurer, U., Tschudi, D., Zikas, V.: Bitcoin as a transaction ledger: a composable treatment. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 324\u2013356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_11"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Bagaria, V.K., Kannan, S., Tse, D., Fanti, G.C., Viswanath, P.: Prism: deconstructing the blockchain to approach physical limits. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) 26th Conference on Computer and Communications Security, ACM CCS 2019, London, UK, 11\u201315 November 2019, pp. 585\u2013602. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363213","DOI":"10.1145\/3319535.3363213"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) 1st Conference on Computer and Communications Security, ACM CCS 1993, Fairfax, Virginia, USA, 3\u20135 November 1993, pp. 62\u201373. ACM Press (19993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0035753","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1989","unstructured":"Berman, P., Garay, J.A.: Asymptotically optimal distributed consensus. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 80\u201394. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035753"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, USA, 30 October\u20131 November 1989, pp. 410\u2013415. IEEE Computer Society Press (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63511","DOI":"10.1109\/SFCS.1989.63511"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Bracha, G.: An asynchronous [(n-1)\/3]-resilient consensus protocol. In: Probert, R.L., Lynch, N.A., Santoro, N. (eds.) 3rd ACM Symposium Annual on Principles of Distributed Computing, Vancouver, BC, Canada, 27\u201329 August 1984, pp. 154\u2013162. Association for Computing Machinery (1984). https:\/\/doi.org\/10.1145\/800222.806743","DOI":"10.1145\/800222.806743"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"1_CR11","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (2000). https:\/\/eprint.iacr.org\/2000\/067"},{"key":"1_CR12","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, 22\u201325 February 1999, pp. 173\u2013186. USENIX Association (1999)"},{"key":"1_CR13","unstructured":"Chan, T.H.H., Ephraim, N., Marcedone, A., Morgan, A., Pass, R., Shi, E.: Blockchain with varying number of players. Cryptology ePrint Archive, Report 2020\/677 (2020). https:\/\/eprint.iacr.org\/2020\/677"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-030-17653-2_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"T-H Hubert Chan","year":"2019","unstructured":"Hubert Chan, T.-H., Pass, R., Shi, E.: Consensus through herding. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 720\u2013749. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_24"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00145-018-9279-y","volume":"32","author":"R Cohen","year":"2019","unstructured":"Cohen, R., Coretti, S., Garay, J.A., Zikas, V.: Probabilistic termination and composability of cryptographic protocols. J. Cryptol. 32(3), 690\u2013741 (2019). https:\/\/doi.org\/10.1007\/s00145-018-9279-y","journal-title":"J. Cryptol."},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: a DAG-based mempool and efficient BFT consensus. In: Bromberg, Y., Kermarrec, A., Kozyrakis, C. (eds.) Seventeenth European Conference on Computer Systems, EuroSys 2022, Rennes, France, 5\u20138 April 2022, pp. 34\u201350. ACM (2022). https:\/\/doi.org\/10.1145\/3492321.3519594","DOI":"10.1145\/3492321.3519594"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev, D.: The Byzantine generals strike again. J. Algorithms 3(1), 14\u201330 (1982). https:\/\/doi.org\/10.1016\/0196-6774(82)90004-9","journal-title":"J. Algorithms"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Dolev, D., Halpern, J.Y., Strong, R.H.: On the possibility and impossibility of achieving clock synchronization. J. Comput. Syst. Sci. 32(2), 230\u2013250 (1986)","DOI":"10.1016\/0022-0000(86)90028-0"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986). https:\/\/doi.org\/10.1145\/5925.5931","journal-title":"J. ACM"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988). https:\/\/doi.org\/10.1145\/42282.42283","DOI":"10.1145\/42282.42283"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-662-45472-5_28","volume-title":"Financial Cryptography and Data Security","author":"I Eyal","year":"2014","unstructured":"Eyal, I., Sirer, E.G.: Majority is not enough: bitcoin mining is vulnerable. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 436\u2013454. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_28"},{"issue":"2","key":"1_CR23","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). https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: Borowsky, E., Rajsbaum, S. (eds.) 22nd ACM Symposium Annual on Principles of Distributed Computing, Boston, MA, USA, 13\u201316 July 2003, pp. 211\u2013220. Association for Computing Machinery (2003). https:\/\/doi.org\/10.1145\/872035.872066","DOI":"10.1145\/872035.872066"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-64375-1_12","volume-title":"Theory of Cryptography","author":"M Fitzi","year":"2020","unstructured":"Fitzi, M., Ga\u017ei, P., Kiayias, A., Russell, A.: Ledger combiners for fast settlement. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 322\u2013352. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_12"},{"key":"1_CR26","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: Full analysis of Nakamoto consensus in bounded-delay networks. Cryptology ePrint Archive, Report 2020\/277 (2020). https:\/\/eprint.iacr.org\/2020\/277"},{"key":"1_CR27","unstructured":"Garay, J., Kiayias, A., Shen, Y.: State machine replication among strangers, fast and self-sufficient. Cryptology ePrint Archive, Report 2025\/616 (2025). https:\/\/eprint.iacr.org\/2025\/616"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-40186-3_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"J Garay","year":"2020","unstructured":"Garay, J., Kiayias, A.: SoK: a consensus taxonomy in the blockchain era. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 284\u2013318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_13"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-63688-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Garay","year":"2017","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol with chains of variable difficulty. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 291\u2013323. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_10"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Kiayias, A., Shen, Y.: Permissionless clock synchronization with public setup. In: Kiltz, E., Vaikuntanathan, V. (eds.) 20th Theory of Cryptography Conference, TCC\u00a02022, Part\u00a0III, Chicago, IL, USA, 7\u201310 November 2022. LNCS, vol. 13749, pp. 181\u2013211. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22368-6_7","DOI":"10.1007\/978-3-031-22368-6_7"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Kiayias, A., Shen, Y.: Proof-of-work-based consensus in expected-constant time. In: Joye, M., Leander, G. (eds.) Advances in Cryptology, EUROCRYPT\u00a02024, Part\u00a0III. LNCS, Zurich, Switzerland, 26\u201330 May 2024, vol. 14653, pp. 96\u2013125. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58734-4_4","DOI":"10.1007\/978-3-031-58734-4_4"},{"issue":"2","key":"1_CR33","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/0885-064X(85)90010-X","volume":"1","author":"JY Halpern","year":"1985","unstructured":"Halpern, J.Y., Megiddo, N., Munshi, A.A.: Optimal precision in the presence of uncertainty. J. Complex. 1(2), 170\u2013196 (1985). https:\/\/doi.org\/10.1016\/0885-064X(85)90010-X","journal-title":"J. Complex."},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Halpern, J.Y., Simons, B., Strong, H.R., Dolev, D.: Fault-tolerant clock synchronization. In: Probert, R.L., Lynch, N.A., Santoro, N. (eds.) 3rd ACM Symposium Annual on Principles of Distributed Computing, Vancouver, BC, Canada, 27\u201329 August 1984, pp. 89\u2013102. Association for Computing Machinery (1984). https:\/\/doi.org\/10.1145\/800222.806739","DOI":"10.1145\/800222.806739"},{"key":"1_CR35","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":"1_CR36","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":"1_CR37","doi-asserted-by":"publisher","unstructured":"Lamport, L., Melliar-Smith, P.M.: Synchronizing clocks in the presence of faults. J. ACM 32(1), 52\u201378 (1985). https:\/\/doi.org\/10.1145\/2455.2457","DOI":"10.1145\/2455.2457"},{"issue":"3","key":"1_CR38","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982). https:\/\/doi.org\/10.1145\/357172.357176","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Lenzen, C., Loss, J.: Optimal clock synchronization with signatures. In: Milani, A., Woelfel, P. (eds.) 41st ACM Symposium Annual on Principles of Distributed Computing, Salerno, Italy, 25\u201329 July 2022, pp. 440\u2013449. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3519270.3538444","DOI":"10.1145\/3519270.3538444"},{"issue":"2","key":"1_CR40","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(84)80033-9","volume":"62","author":"J Lundelius","year":"1984","unstructured":"Lundelius, J., Lynch, N.: An upper and lower bound for clock synchronization. Inf. Control 62(2), 190\u2013204 (1984). https:\/\/doi.org\/10.1016\/S0019-9958(84)80033-9","journal-title":"Inf. Control"},{"key":"1_CR41","doi-asserted-by":"publisher","unstructured":"Lundelius, J., Lynch, N.A.: A new fault-tolerant algorithm for clock synchronization. In: Probert, R.L., Lynch, N.A., Santoro, N. (eds.) 3rd ACM Symposium Annual on Principles of Distributed Computing, Vancouver, BC, Canada, 27\u201329 August 1984, pp. 75\u201388. Association for Computing Machinery (1984). https:\/\/doi.org\/10.1145\/800222.806738","DOI":"10.1145\/800222.806738"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Mahaney, S.R., Schneider, F.B.: Inexact agreement: accuracy, precision, and graceful degradation. In: Malcolm, M.A., Strong, H.R. (eds.) 4th ACM Symposium Annual on Principles of Distributed Computing, Minaki, Ontario, Canada, 5\u20137 August 1985, pp. 237\u2013249. Association for Computing Machinery (1985). https:\/\/doi.org\/10.1145\/323596.323618","DOI":"10.1145\/323596.323618"},{"key":"1_CR43","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system, December 2008. https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-56614-6_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Seeman, L., Shelat, A.: Analysis of the blockchain protocol in asynchronous networks. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 643\u2013673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_22"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E.: FruitChains: a fair blockchain. In: Schiller, E.M., Schwarzmann, A.A. (eds.) 36th ACM Symposium Annual on Principles of Distributed Computing, Washington, DC, USA, 25\u201327 July 2017, pp. 315\u2013324. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3087801.3087809","DOI":"10.1145\/3087801.3087809"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E.: Rethinking large-scale consensus. In: K\u00f6pf, B., Chong, S. (eds.) IEEE 30th Computer Security Foundations Symposium, CSF 2017, Santa Barbara, CA, USA, 21\u201325 August 2017, pp. 115\u2013129. IEEE Computer Society Press (2017). https:\/\/doi.org\/10.1109\/CSF.2017.37","DOI":"10.1109\/CSF.2017.37"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","DOI":"10.1145\/322186.322188"},{"key":"1_CR48","doi-asserted-by":"publisher","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990). https:\/\/doi.org\/10.1145\/98163.98167","DOI":"10.1145\/98163.98167"},{"key":"1_CR49","doi-asserted-by":"publisher","unstructured":"Srikanth, T.K., Toueg, S.: Optimal clock synchronization. J. ACM 34(3), 626\u2013645 (1987). https:\/\/doi.org\/10.1145\/28869.28876","DOI":"10.1145\/28869.28876"},{"key":"1_CR50","doi-asserted-by":"publisher","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Golan-Gueta, G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Robinson, P., Ellen, F. (eds.) 38th ACM Symposium Annual on Principles of Distributed Computing, Toronto, ON, Canada, 29 July\u20132 August 2019, pp. 347\u2013356. Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T09:20:36Z","timestamp":1755508836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}