{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:58:52Z","timestamp":1786982332984,"version":"build-2736575974"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach to maximize the channel capacities. Message-based consensus protocols such as practical Byzantine fault tolerance (pBFT) adhere partially to said scenario. Protocol phases with many-to-many communication, however, still suffer from quadratic growth in the number of required transmissions to reach consensus. We show that an enhancement in the data transmission behavior in the quadratic phases is possible through combining RLNC with pBFT as one hybrid protocol. We present several experiments conducted on random network topologies. We conclude that using RLNC-based data transmission offers a significantly better performance under specific circumstances, which depend on the number of participating network nodes and the chosen coding parameters. Applying the same approach to other combinations of message-based consensus and network coding protocols promises not only a gain in performance, but may also improve robustness and security and open up new application scenarios for RLNC, e.g., running it on the application layer.<\/jats:p>","DOI":"10.1007\/s12243-022-00930-x","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:03:48Z","timestamp":1671753828000},"page":"33-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient practical Byzantine consensus using random linear network coding"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9816-2216","authenticated-orcid":false,"given":"Michael","family":"Braun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Wiesmaier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nouri","family":"Alnahawi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,23]]},"reference":[{"issue":"4","key":"930_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li SR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"key":"930_CR2","unstructured":"Castro M, Liskov B (1999) Practical Byzantine fault tolerance. In: Proceedings of the third symposium on operating systems design and implementation. OSDI \u201999. USENIX Association, pp 173\u2013186"},{"issue":"10","key":"930_CR3","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"Ho T, M\u00e9dard M, Koetter R, Karger DR, Effros M, Shi J, Leong B (2006) A random linear network coding approach to Multicast. IEEE Trans Inf Theory 52(10):4413\u20134430","journal-title":"IEEE Trans Inf Theory"},{"key":"930_CR4","doi-asserted-by":"crossref","unstructured":"Lamport L, Shostak R, Pease M (1982) The Byzantine generals problem. ACM Trans Program Lang Syst, pp 382\u2013401","DOI":"10.1145\/357172.357176"},{"key":"930_CR5","doi-asserted-by":"crossref","unstructured":"Driscoll K, Hall B, Sivencrona H, Zumsteg P (2003) Byzantine fault tolerance, from theory to reality. In: Computer safety reliability, and security","DOI":"10.1007\/978-3-540-39878-3_19"},{"key":"930_CR6","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/18.761254","volume":"45","author":"RW Yeung","year":"1999","unstructured":"Yeung RW, Zhang Z (1999) Distributed source coding for satellite communications. IEEE Trans Inf Theory 45:1111\u20131120","journal-title":"IEEE Trans Inf Theory"},{"key":"930_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399\u2013404","journal-title":"Can J Math"},{"key":"930_CR8","doi-asserted-by":"crossref","unstructured":"Ho T, Koetter R, M\u00e9dard M, Karger DR, Effros M (2003) The benefits of coding over routing in a randomized setting. IEEE Int Symp Inf Theory, 2003. Proc, vol 442","DOI":"10.1109\/ISIT.2003.1228459"},{"issue":"5","key":"930_CR9","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R Koetter","year":"2003","unstructured":"Koetter R, M\u00e9dard M (2003) An algebraic approach to network coding. Trans Netw 11 (5):782\u2013795","journal-title":"Trans Netw"},{"key":"930_CR10","doi-asserted-by":"crossref","unstructured":"Oggier F, Datta A (2011) Byzantine fault tolerance of regenerating codes. In: 2011 IEEE Intl Con on P2P","DOI":"10.1109\/P2P.2011.6038668"},{"key":"930_CR11","doi-asserted-by":"crossref","unstructured":"Liang G, Vaidya NH (2012) Byzantine broadcast in point-to-point networks using local linear coding. In: ACM Symposium PODC","DOI":"10.1145\/2332432.2332492"},{"key":"930_CR12","doi-asserted-by":"crossref","unstructured":"Choi B, Sohn J, Han D, Moon J (2019) Scalable network-coded PBFT consensus algorithm. In: IEEE ISIT","DOI":"10.1109\/ISIT.2019.8849573"},{"key":"930_CR13","doi-asserted-by":"crossref","unstructured":"Lun DS, Ratnakar N, Koetter R, M\u00e9dard M, Ahmed E, Lee H (2005) Achieving minimum-cost multicast: a decentralized approach based on network coding. In: 24th IEEE INFOCOM, vol 3","DOI":"10.1109\/INFCOM.2005.1498443"},{"key":"930_CR14","doi-asserted-by":"crossref","unstructured":"Cebe M, Kaplan B, Akkaya K (2018) A network coding based information spreading approach for permissioned blockchain in IoT settings. In: 15th EAI Intl Con MOBIQUITOUS","DOI":"10.1145\/3286978.3286984"},{"key":"930_CR15","doi-asserted-by":"crossref","unstructured":"Adat V, Politis I, Tselios C, Galiotos P, Kotsopoulos S (2018) On Blockchain enhanced secure network coding for 5G deployments. In: IEEE GLOBECOM","DOI":"10.1109\/GLOCOM.2018.8647581"},{"issue":"1","key":"930_CR16","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/43921.43922","volume":"22","author":"A Demers","year":"1988","unstructured":"Demers A, Greene D, Houser C, Irish W, Larson J, Shenker S, Sturgis H, Swinehart D, Terry D (1988) Epidemic algorithms for replicated database maintenance. SIGOPS Oper Syst Rev 22(1):8\u201332","journal-title":"SIGOPS Oper Syst Rev"},{"issue":"6","key":"930_CR17","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/TIT.2006.874532","volume":"52","author":"S Deb","year":"2006","unstructured":"Deb S, Medard M, Choute C (2006) Algebraic Gossip : a network coding approach to optimal multiple rumor Mongering. IEEE Trans Inf Theory 52(6):2486\u20132507","journal-title":"IEEE Trans Inf Theory"},{"key":"930_CR18","doi-asserted-by":"crossref","unstructured":"Haeupler B (2011) Analyzing network coding gossip made easy. In: Proceedings of the forty-third annual ACM symposium on theory of computing. Association for Computing Machinery, pp 293\u2013302","DOI":"10.1145\/1993636.1993676"},{"key":"930_CR19","doi-asserted-by":"crossref","unstructured":"Bromberg Y-D, Dufour Q, Frey D (2019) Multisource rumor spreading with network coding. In: IEEE INFOCOM 2019\u2014IEEE conference on computer communications, pp 2359\u20132367","DOI":"10.1109\/INFOCOM.2019.8737576"},{"key":"930_CR20","doi-asserted-by":"crossref","unstructured":"Braun M, Wiesmaier A, Alnahawi N, Gei\u00dfler J (2021) On message-based consensus and network coding. In: NoF 2021\u201412th international conference on network of the future","DOI":"10.1109\/NoF52522.2021.9609913"},{"key":"930_CR21","doi-asserted-by":"crossref","unstructured":"El Ioini N, Pahl C (2018) A review of distributed ledger technologies. In: OTM Confederated international conferences on the move to meaningful internet systems, pp 277\u2013288","DOI":"10.1007\/978-3-030-02671-4_16"},{"key":"930_CR22","doi-asserted-by":"publisher","first-page":"675","DOI":"10.22214\/ijraset.2019.2096","volume":"7","author":"D Gol","year":"2019","unstructured":"Gol D. (2019) An analysis of consensus algorithms for the blockchain technology. Int J for Res Appl Sci Eng Technol 7:675\u2013680","journal-title":"Int J for Res Appl Sci Eng Technol"},{"key":"930_CR23","volume-title":"Finite fields","author":"R Lidl","year":"1997","unstructured":"Lidl R, Niederreiter H (1997) Finite fields. Cambridge University Press, Cambridge"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-022-00930-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12243-022-00930-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-022-00930-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T18:37:06Z","timestamp":1728585426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12243-022-00930-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,23]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["930"],"URL":"https:\/\/doi.org\/10.1007\/s12243-022-00930-x","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,23]]},"assertion":[{"value":"5 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}