{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:31:15Z","timestamp":1781076675245,"version":"3.54.1"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115763","type":"journal-article","created":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T16:03:44Z","timestamp":1769875424000},"page":"115763","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Byzantine reliable broadcast and tendermint consensus with trusted components"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6942-0412","authenticated-orcid":false,"given":"Yackolley","family":"Amoussou-Guenou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7497-3169","authenticated-orcid":false,"given":"Lionel","family":"Beltrando","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3059-8926","authenticated-orcid":false,"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6488-8326","authenticated-orcid":false,"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2026.115763_bib0001","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/j.tcs.2026.115763_bib0002","series-title":"Distributed Algorithms, 10Th International Workshop, WDAG \u201996, Bologna, Italy, October 9-11, 1996","first-page":"40","article-title":"Levels of authentication in distributed agreement","author":"Borcherding","year":"1996"},{"key":"10.1016\/j.tcs.2026.115763_bib0003","series-title":"2021 IEEE 41St International Conference on Distributed Computing Systems (ICDCS)","first-page":"506","article-title":"Practical byzantine reliable broadcast on partially connected networks","author":"Bonomi","year":"2021"},{"key":"10.1016\/j.tcs.2026.115763_bib0004","series-title":"27Th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6\u20138, 2023, Tokyo, Japan","first-page":"18:1","article-title":"Reliable broadcast despite mobile byzantine faults","volume":"286","author":"Bonomi","year":"2023"},{"key":"10.1016\/j.tcs.2026.115763_bib0005","unstructured":"R. Guerraoui, J. Komatovic, P. Kuznetsov, Y.-A. Pignolet, D.-A. Seredinschi, A. Tonkikh, Dynamic byzantine reliable broadcast [technical report], arXiv: 2001.06271(2020)."},{"key":"10.1016\/j.tcs.2026.115763_bib0006","series-title":"2014 IEEE 33Rd International Symposium on Reliable Distributed Systems","first-page":"152","article-title":"Self-stabilizing byzantine broadcast","author":"Maurer","year":"2014"},{"key":"10.1016\/j.tcs.2026.115763_bib0007","series-title":"Fault-tolerant message-passing distributed systems: an algorithmic approach","author":"Raynal","year":"2018"},{"key":"10.1016\/j.tcs.2026.115763_bib0008","series-title":"23Rd International Symposium on Reliable Distributed Systems (SRDS 2004), 18\u201320 October 2004, Florianpolis, Brazil","first-page":"174","article-title":"How to tolerate half less one byzantine nodes in practical distributed systems","author":"Correia","year":"2004"},{"issue":"6","key":"10.1016\/j.tcs.2026.115763_bib0009","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1093\/comjnl\/bxs148","article-title":"BFT-TO: intrusion tolerance with less replicas","volume":"56","author":"Correia","year":"2013","journal-title":"Comput. J."},{"key":"10.1016\/j.tcs.2026.115763_bib0010","series-title":"Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 21\u201323, 1983, Colony Square Hotel, Atlanta, Georgia, USA","first-page":"1","article-title":"Impossibility of distributed consensus with one faulty process","author":"Fischer","year":"1983"},{"key":"10.1016\/j.tcs.2026.115763_bib0011","series-title":"Proceedings of the 21St ACM Symposium on Operating Systems Principles 2007, SOSP 2007, Stevenson, Washington, USA, October 14\u201317, 2007","first-page":"189","article-title":"Attested append-only memory: making adversaries stick to their word","author":"Chun","year":"2007"},{"key":"10.1016\/j.tcs.2026.115763_bib0012","first-page":"184","article-title":"Communication-efficient BFT protocols using small trusted hardware to tolerate minority corruption","author":"Yandamuri","year":"2021","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"10.1016\/j.tcs.2026.115763_bib0013","series-title":"EuroSys \u201922: seventeenth European Conference on Computer Systems, Rennes, France, April 5 - 8, 2022","first-page":"1","article-title":"DAMYSUS: streamlined BFT consensus leveraging trusted components","author":"Decouchant","year":"2022"},{"key":"10.1016\/j.tcs.2026.115763_bib0014","series-title":"24Th International Conference on Distributed Computing and Networking, ICDCN 2023, Kharagpur, India, January 4\u20137, 2023","first-page":"90","article-title":"Tendertee: increasing the resilience of tendermint by using trusted environments","author":"Beltrando","year":"2023"},{"key":"10.1016\/j.tcs.2026.115763_bib0015","series-title":"Proceedings of the 6Th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2009, April 22\u201324, 2009, Boston, MA, USA","first-page":"1","article-title":"Trinc: small trusted hardware for large distributed systems","author":"Levin","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2026.115763_bib0016","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TC.2011.221","article-title":"Efficient byzantine fault-tolerance","volume":"62","author":"Veronese","year":"2013","journal-title":"IEEE Transp. Computers."},{"key":"10.1016\/j.tcs.2026.115763_bib0017","series-title":"Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22\u201326, 2010","first-page":"475","article-title":"Asynchronous byzantine consensus with 2f+1 processes","author":"Correia","year":"2010"},{"key":"10.1016\/j.tcs.2026.115763_bib0018","unstructured":"R. Wattenhofer, Distributed systems, 2022, (Lecture notes, https:\/\/disco.ethz.ch\/courses\/hs21\/distsys\/lnotes\/DistSys_Script.pdf)."},{"key":"10.1016\/j.tcs.2026.115763_bib0019","series-title":"Stabilization, Safety, and Security of Distributed Systems - 26Th International Symposium, SSS 2024, Nagoya, Japan, October 20\u201322, 2024, Proceedings","first-page":"360","article-title":"Byzantine reliable broadcast with one trusted monotonic counter","volume":"14931","author":"Amoussou-Guenou","year":"2024"},{"key":"10.1016\/j.tcs.2026.115763_bib0020","unstructured":"J. Kwon, Tendermint: consensus without mining, 2014, (https:\/\/tendermint.com\/static\/docs\/tendermint.pdf). [Online; accessed 2020 July 10]."},{"key":"10.1016\/j.tcs.2026.115763_bib0021","series-title":"22Nd International Conference on Principles of Distributed Systems, OPODIS 2018, December 17\u201319, 2018, Hong Kong, China","first-page":"16:1","article-title":"Correctness of tendermint-Core blockchains","volume":"125","author":"Amoussou-Guenou","year":"2018"},{"key":"10.1016\/j.tcs.2026.115763_bib0022","series-title":"Networked Systems - 7Th International Conference, NETYS 2019, Marrakech, Morocco, June 19\u201321, 2019, Revised Selected Papers","first-page":"166","article-title":"Dissecting tendermint","volume":"11704","author":"Amoussou-Guenou","year":"2019"},{"key":"10.1016\/j.tcs.2026.115763_bib0023","series-title":"ACM Symposium on Principles of Distributed Computing, PODC \u201912, Funchal, Madeira, Portugal, July 16\u201318, 2012","first-page":"301","article-title":"On the (limited) power of non-equivocation","author":"Clement","year":"2012"},{"key":"10.1016\/j.tcs.2026.115763_bib0024","series-title":"PODC \u201922: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022","first-page":"450","article-title":"Revisiting the power of non-equivocation in distributed protocols","author":"Ben-David","year":"2022"},{"issue":"2","key":"10.1016\/j.tcs.2026.115763_bib0025","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","article-title":"Consensus in the presence of partial synchrony","volume":"35","author":"Dwork","year":"1988","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.tcs.2026.115763_bib0026","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","article-title":"Asynchronous byzantine agreement protocols","volume":"75","author":"Bracha","year":"1987","journal-title":"Inf. Comp."},{"key":"10.1016\/j.tcs.2026.115763_bib0027","series-title":"42Nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24\u201327 May 2021","first-page":"466","article-title":"Red belly: a secure, fair and scalable open blockchain","author":"Crain","year":"2021"},{"issue":"3","key":"10.1016\/j.tcs.2026.115763_bib0028","doi-asserted-by":"crossref","first-page":"2150006:1","DOI":"10.1142\/S0129626421500067","article-title":"On the versatility of Bracha\u2019s byzantine reliable broadcast algorithm","volume":"31","author":"Raynal","year":"2021","journal-title":"Parall. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115763_bib0029","unstructured":"E. Buchman, J. Kwon, Z. Milosevic, The latest gossip on BFT consensus, arXiv: 1807.04938(2018)."},{"key":"10.1016\/j.tcs.2026.115763_bib0030","unstructured":"S. Nakamoto, Bitcoin: a peer-to-peer electronic cash system, 2008, (https:\/\/bitcoin.org\/bitcoin.pdf)."},{"key":"10.1016\/j.tcs.2026.115763_bib0031","unstructured":"V. Buterin, Ethereum whitepaper. https:\/\/ethereum.org."},{"key":"10.1016\/j.tcs.2026.115763_bib0032","article-title":"Solidus: an incentive-compatible cryptocurrency based on permissionless byzantine consensus","author":"Abraham","year":"2016","journal-title":"CoRR abs\/1612.02916"},{"key":"10.1016\/j.tcs.2026.115763_bib0033","series-title":"Proceedings of the 25Th USENIX Security Symposium","article-title":"Enhancing bitcoin security and performance with strong consistency via collective signing","author":"Kokoris-Kogias","year":"2016"},{"key":"10.1016\/j.tcs.2026.115763_bib0034","series-title":"Proceedings of the 17Th International Conference on Distributed Computing and Networking Conference (ICDCN)","article-title":"Bitcoin meets strong consistency","author":"Decker","year":"2016"},{"key":"10.1016\/j.tcs.2026.115763_bib0035","series-title":"Proceedings of the Thirteenth EuroSys Conference, EuroSys 2018, Porto, Portugal, April 23\u201326, 2018","first-page":"30:1","article-title":"Hyperledger fabric: a distributed operating system for permissioned blockchains","author":"Androulaki","year":"2018"},{"key":"10.1016\/j.tcs.2026.115763_bib0036","article-title":"Hot-stuff the linear, optimal-Resilience, one-Message BFT devil","volume":"abs\/1803.05069","author":"Abraham","year":"2018","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2026.115763_bib0037","series-title":"4Th International Symposium on Foundations and Applications of Blockchain 2021, FAB 2021, May 7, 2021, University of California, Davis, California, USA (Virtual Conference)","first-page":"1:1","article-title":"Tenderbake - a solution to dynamic repeated consensus for blockchains","volume":"92","author":"Astefanoaei","year":"2021"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:05:25Z","timestamp":1772193925000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":37,"alternative-id":["S0304397526000228"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115763","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Byzantine reliable broadcast and tendermint consensus with trusted components","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115763","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115763"}}