{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:14Z","timestamp":1783576934736,"version":"3.55.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031917356","type":"print"},{"value":"9783031917363","type":"electronic"}],"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-031-91736-3_2","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:02:00Z","timestamp":1747864920000},"page":"23-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asynchronous Byzantine Consensus with\u00a0Trusted Monotonic Counters"],"prefix":"10.1007","author":[{"given":"Yackolley","family":"Amoussou-Guenou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Robinson, P., Ellen, F. (eds.) Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, 29 July\u20132 August 2019, pp. 337\u2013346. ACM (2019). https:\/\/doi.org\/10.1145\/3293611.3331612","DOI":"10.1145\/3293611.3331612"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Amoussou-Guenou, Y., Beltrando, L., Herlihy, M., Potop-Butucaru, M.: Byzantine reliable broadcast with one trusted monotonic counter. In: Masuzawa, T., Katayama, Y., Kakugawa, H., Nakamura, J., Kim, Y. (eds.) Stabilization, Safety, and Security of Distributed Systems - 26th International Symposium, SSS 2024, Nagoya, Japan, 20\u201322 October 2024, Proceedings. Lecture Notes in Computer Science, vol. 14931, pp. 360\u2013374. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-74498-3_26","DOI":"10.1007\/978-3-031-74498-3_26"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Beltrando, L., Potop-Butucaru, M., Alfaro, J.: Tendertee: increasing the resilience of tendermint by using trusted environments. In: 24th International Conference on Distributed Computing and Networking, ICDCN 2023, Kharagpur, India, 4\u20137 January 2023, pp. 90\u201399. ACM (2023). https:\/\/doi.org\/10.1145\/3571306.3571394","DOI":"10.1145\/3571306.3571394"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Ben-David, N., Chan, B.Y., Shi, E.: Revisiting the power of non-equivocation in distributed protocols. In: Milani, A., Woelfel, P. (eds.) PODC \u201922: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 25\u201329 July 2022, pp. 450\u2013459. ACM (2022)","DOI":"10.1145\/3519270.3538427"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Decouchant, J., Farina, G., Rahli, V., Tixeuil, S.: Practical byzantine reliable broadcast on partially connected networks. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pp. 506\u2013516. IEEE (2021)","DOI":"10.1109\/ICDCS51616.2021.00055"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Bonomi, S., Farina, G., Tixeuil, S.: Reliable broadcast despite mobile byzantine faults. In: Bessani, A., D\u00e9fago, X., Nakamura, J., Wada, K., Yamauchi, Y. (eds.) 27th International Conference on Principles of Distributed Systems, OPODIS 2023, Tokyo, Japan, 6\u20138 December 2023. LIPIcs, vol.\u00a0286, pp. 18:1\u201318:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.OPODIS.2023.18","DOI":"10.4230\/LIPICS.OPODIS.2023.18"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90054-X","journal-title":"Inf. Comput."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Cheung, L., Kaynar, D.K., Lynch, N.A., Pereira, O.: Compositional security for task-pioas. In: 20th IEEE Computer Security Foundations Symposium, CSF 2007, Venice, Italy, 6\u20138 July 2007, pp. 125\u2013139. IEEE Computer Society (2007)","DOI":"10.1109\/CSF.2007.15"},{"key":"2_CR9","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: 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). https:\/\/dl.acm.org\/citation.cfm?id=296824"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/J.TCS.2019.02.001","volume":"777","author":"J Chen","year":"2019","unstructured":"Chen, J., Micali, S.: Algorand: a secure and efficient distributed ledger. Theor. Comput. Sci. 777, 155\u2013183 (2019). https:\/\/doi.org\/10.1016\/J.TCS.2019.02.001","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Chun, B., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. In: Proceedings of the 21st ACM Symposium on Operating Systems Principles 2007, SOSP 2007, Stevenson, Washington, USA, 14\u201317 October 2007, pp. 189\u2013204. ACM (2007). https:\/\/doi.org\/10.1145\/1294261.1294280","DOI":"10.1145\/1294261.1294280"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Civit, P., Potop-Butucaru, M.: Brief announcement: composable dynamic secure emulation. In: Agrawal, K., Lee, I.A. (eds.) SPAA \u201922: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, 11\u201314 July 2022, pp. 103\u2013105. ACM (2022)","DOI":"10.1145\/3490148.3538562"},{"key":"2_CR15","unstructured":"Civit, P., Potop-Butucaru, M.: Dynamic probabilistic input output automata. In: Scheideler, C. (ed.) 36th International Symposium on Distributed Computing, DISC 2022, Augusta, Georgia, USA, 25\u201327 October 2022. LIPIcs, vol.\u00a0246, pp. 15:1\u201315:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Clement, A., Junqueira, F., Kate, A., Rodrigues, R.: On the (limited) power of non-equivocation. In: ACM Symposium on Principles of Distributed Computing, PODC \u201912, Funchal, Madeira, Portugal, 16\u201318 July 2012, pp. 301\u2013308. ACM (2012). https:\/\/doi.org\/10.1145\/2332432.2332490","DOI":"10.1145\/2332432.2332490"},{"key":"2_CR17","unstructured":"Cohen, S., Keidar, I.: Brief announcement: subquadratic multivalued asynchronous byzantine agreement WHP. In: Oshman, R. (ed.) 37th International Symposium on Distributed Computing, DISC 2023, L\u2019Aquila, Italy, 10\u201312 October 2023. LIPIcs, vol.\u00a0281, pp. 39:1\u201339:6. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Correia, M., Neves, N.F., Ver\u00edssimo, P.: How to tolerate half less one byzantine nodes in practical distributed systems. In: 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), Florianpolis, Brazil, 18\u201320 October 2004, pp. 174\u2013183. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/RELDIS.2004.1353018","DOI":"10.1109\/RELDIS.2004.1353018"},{"issue":"6","key":"2_CR19","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1093\/comjnl\/bxs148","volume":"56","author":"M Correia","year":"2013","unstructured":"Correia, M., Neves, N.F., Ver\u00edssimo, P.: BFT-TO: intrusion tolerance with less replicas. Comput. J. 56(6), 693\u2013715 (2013). https:\/\/doi.org\/10.1093\/comjnl\/bxs148","journal-title":"Comput. J."},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Correia, M., Veronese, G.S., Lung, L.C.: Asynchronous byzantine consensus with 2f+1 processes. In: Shin, S.Y., Ossowski, S., Schumacher, M., Palakal, M.J., Hung, C. (eds.) Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, 22\u201326 March 2010, pp. 475\u2013480. ACM (2010). https:\/\/doi.org\/10.1145\/1774088.1774187","DOI":"10.1145\/1774088.1774187"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Decouchant, J., Kozhaya, D., Rahli, V., Yu, J.: DAMYSUS: streamlined BFT consensus leveraging trusted components. In: EuroSys \u201922: Seventeenth European Conference on Computer Systems, Rennes, France, 5\u20138 April 2022, pp. 1\u201316. ACM (2022). https:\/\/doi.org\/10.1145\/3492321.3519568","DOI":"10.1145\/3492321.3519568"},{"issue":"9","key":"2_CR22","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1109\/TC.2015.2495213","volume":"65","author":"T Distler","year":"2016","unstructured":"Distler, T., Cachin, C., Kapitza, R.: Resource-efficient byzantine fault tolerance. IEEE Trans. Comput. 65(9), 2807\u20132819 (2016). https:\/\/doi.org\/10.1109\/TC.2015.2495213","journal-title":"IEEE Trans. Comput."},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. In: Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Colony Square Hotel, Atlanta, Georgia, USA, 21\u201323 March 1983, pp.\u00a01\u20137. ACM (1983). https:\/\/doi.org\/10.1145\/588058.588060","DOI":"10.1145\/588058.588060"},{"key":"2_CR24","unstructured":"Guerraoui, R., Komatovic, J., Kuznetsov, P., Pignolet, Y.A., Seredinschi, D.A., Tonkikh, A.: Dynamic byzantine reliable broadcast [technical report]. arXiv preprint arXiv:2001.06271 (2020)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Gupta, S., Rahnama, S., Pandey, S., Crooks, N., Sadoghi, M.: Dissecting BFT consensus: in trusted components we trust! In: Luna, G.A.D., Querzoni, L., Fedorova, A., Narayanan, D. (eds.) Proceedings of the Eighteenth European Conference on Computer Systems, EuroSys 2023, Rome, Italy, 8\u201312 May 2023, pp. 521\u2013539. ACM (2023)","DOI":"10.1145\/3552326.3587455"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Kapitza, R., et al.: Cheapbft: resource-efficient byzantine fault tolerance. In: European Conference on Computer Systems, Proceedings of the Seventh EuroSys Conference 2012, EuroSys \u201912, Bern, Switzerland, 10\u201313 April 2012, pp. 295\u2013308. ACM (2012). https:\/\/doi.org\/10.1145\/2168836.2168866","DOI":"10.1145\/2168836.2168866"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Breaking the O(n$$ ^{\\text{2}}$$) bit barrier: scalable byzantine agreement with an adaptive adversary. J. ACM 58(4), 18:1\u201318:24 (2011)","DOI":"10.1145\/1989727.1989732"},{"issue":"3","key":"2_CR28","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). https:\/\/doi.org\/10.1145\/357172.357176","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Leinweber, M., Hartenstein, H.: Brief announcement: Let it TEE: asynchronous byzantine atomic broadcast with n $$\\ge $$ 2f+1. In: Oshman, R. (ed.) 37th International Symposium on Distributed Computing, DISC 2023, L\u2019Aquila, Italy, 10\u201312 October 2023. LIPIcs, vol.\u00a0281, pp. 43:1\u201343:7. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2023.43","DOI":"10.4230\/LIPIcs.DISC.2023.43"},{"key":"2_CR30","unstructured":"Levin, D., Douceur, J.R., Lorch, J.R., Moscibroda, T.: Trinc: small trusted hardware for large distributed systems. In: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2009, Boston, MA, USA, 22\u201324 April 2009, pp. 1\u201314. USENIX Association (2009). http:\/\/www.usenix.org\/events\/nsdi09\/tech\/ full_papers\/levin\/levin.pdf"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Maurer, A., Tixeuil, S.: Self-stabilizing byzantine broadcast. In: 2014 IEEE 33rd International Symposium on Reliable Distributed Systems, pp. 152\u2013160. IEEE (2014)","DOI":"10.1109\/SRDS.2014.10"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science, FOCS \u201999, New York, NY, USA, 17\u201318 October 1999, pp. 120\u2013130. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Micali, S., Vadhan, S., Rabin, M.: Verifiable random functions. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS \u201999, p.\u00a0120. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Most\u00e9faoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous binary byzantine consensus with t < n\/3, o(n2) messages, and O(1) expected time. J. ACM 62(4), 31:1\u201331:21 (2015). https:\/\/doi.org\/10.1145\/2785953","DOI":"10.1145\/2785953"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Perrin, M., Weibel, J.: Randomized consensus: Common coins are not the holy grail! Technical report, LS2N-Nantes Universit\u00e9 (2024)","DOI":"10.1145\/3662158.3662824"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-94141-7"},{"issue":"1","key":"2_CR37","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"GS Veronese","year":"2013","unstructured":"Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C., Ver\u00edssimo, P.: Efficient byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16\u201330 (2013). https:\/\/doi.org\/10.1109\/TC.2011.221","journal-title":"IEEE Trans. Comput."},{"key":"2_CR38","unstructured":"Wattenhofer, R.: Distributed systems. Lecture notes (2022). https:\/\/disco.ethz.ch\/courses\/hs21\/distsys\/lnotes\/DistSys_Script.pdf"},{"key":"2_CR39","unstructured":"Yandamuri, S., Abraham, I., Nayak, K., Reiter, M.K.: Communication-efficient BFT protocols using small trusted hardware to tolerate minority corruption. IACR Cryptol. ePrint Arch., 184 (2021). https:\/\/eprint.iacr.org\/2021\/184"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91736-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:02:14Z","timestamp":1747864934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91736-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031917356","9783031917363"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91736-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delphi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"2 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.torontomu.ca\/sirocco-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}