{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:27:52Z","timestamp":1763202472482,"version":"build-2065373602"},"reference-count":45,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Blockchain: Research and Applications"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1016\/j.bcra.2021.100007","type":"journal-article","created":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T11:36:03Z","timestamp":1613907363000},"page":"100007","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Robustness and efficiency of voting consensus protocols within byzantine infrastructures"],"prefix":"10.1016","volume":"2","author":[{"given":"Angelo","family":"Capossele","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Penzkofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.bcra.2021.100007_bib1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/152610.152612","article-title":"The consensus problem in fault-tolerant computing","volume":"25","author":"Barborak","year":"1993","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10.1016\/j.bcra.2021.100007_bib2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0262-8856(95)01044-0","article-title":"Fast visual tracking by temporal consensus","volume":"14","author":"Gee","year":"1996","journal-title":"Image Vis Comput."},{"key":"10.1016\/j.bcra.2021.100007_bib3","unstructured":"M. Mitchell, P. Hraber, J.P. Crutchfield. Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations. arXiv. 1993. preprint."},{"key":"10.1016\/j.bcra.2021.100007_bib4","series-title":"Proceedings of the 44th IEEE Conference on Decision and Control; 15 Dec 2005; Seville, Spain","first-page":"6698","article-title":"Consensus filters for sensor networks and distributed sensor fusion","author":"Olfati-Saber","year":"2005"},{"key":"10.1016\/j.bcra.2021.100007_bib5","series-title":"2010 IEEE International Conference on Robotics and Automation; 3-7 May 2010; Anchorage, AK, USA","first-page":"3026","article-title":"Distributed nonlinear estimation for robot localization using weighted consensus","author":"Simonetto","year":"2010"},{"issue":"9","key":"10.1016\/j.bcra.2021.100007_bib6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.2514\/1.34226","article-title":"Unbiased Kalman consensus algorithm","volume":"5","author":"Alighanbari","year":"2008","journal-title":"J. Aero. Comput. Inf. Commun."},{"issue":"2","key":"10.1016\/j.bcra.2021.100007_bib7","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1103\/RevModPhys.81.591","article-title":"Statistical physics of social dynamics","volume":"81","author":"Castellano","year":"2009","journal-title":"Rev. Mod. Phys."},{"issue":"3","key":"10.1016\/j.bcra.2021.100007_bib8","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/s10458-013-9230-4","article-title":"Majority dynamics and aggregation of information in social networks","volume":"28","author":"Mossel","year":"2013","journal-title":"Aut. Agents Multi-Agent Syst."},{"key":"10.1016\/j.bcra.2021.100007_bib9","series-title":"2017 IEEE International Congress on Big Data (BigData Congress); 25-30 Jun 2017; Honolulu, HI, USA","first-page":"557","article-title":"An overview of blockchain technology: architecture, consensus, and future trends","author":"Zheng","year":"2017"},{"issue":"2","key":"10.1016\/j.bcra.2021.100007_bib10","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.bcra.2021.100007_bib11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.bcra.2021.100007_bib12","first-page":"92","article-title":"One-dimensional uniform arrays that wash out finite islands","volume":"14","author":"G\u00e1cs","year":"1978","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"10.1016\/j.bcra.2021.100007_bib13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2746347","article-title":"Distributed binary consensus in networks with disturbances","volume":"10","author":"Gogolev","year":"2015","journal-title":"ACM Trans. Autonom. Adapt. Syst."},{"key":"10.1016\/j.bcra.2021.100007_bib14","series-title":"2007 IEEE International Conference on Acoustics, Speech and Signal Processing\u2014ICASSP\u2019 07; 15-20 Apr 2007; Honolulu, HI, USA","article-title":"Distributed average consensus in sensor networks with random link failures","author":"Kar","year":"2007"},{"issue":"33","key":"10.1016\/j.bcra.2021.100007_bib15","doi-asserted-by":"crossref","first-page":"12085","DOI":"10.1073\/pnas.0400672101","article-title":"Efficient system-wide coordination in noisy environments","volume":"101","author":"Moreira","year":"2004","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"10.1016\/j.bcra.2021.100007_bib16","series-title":"STOC \u201993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing; May 1993; San Diego, CA, USA","first-page":"101","article-title":"Wait-free k-set agreement is impossible: the Topology of Public Knowledge","author":"Saks","year":"1993"},{"key":"10.1016\/j.bcra.2021.100007_bib17","series-title":"2006 American Control Conference; 14\u201316 Jun 2006; Minneapolis, MN, USA","first-page":"6","article-title":"Discrete-time average-consensus under switching network topologies","author":"Kingston","year":"2006"},{"issue":"9","key":"10.1016\/j.bcra.2021.100007_bib18","doi-asserted-by":"crossref","first-page":"2719","DOI":"10.1016\/j.spa.2016.02.015","article-title":"Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs","volume":"126","author":"Benjamini","year":"2016","journal-title":"Stoch. Process. their Appl."},{"key":"10.1016\/j.bcra.2021.100007_bib19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.jpdc.2020.09.002","article-title":"FPC-BI: Fast probabilistic consensus within Byzantine infrastructures","volume":"147","author":"Popov","year":"2021","journal-title":"J. Parallel Distr. Comput."},{"year":"2019","series-title":"A Reference for Randomness Beacons: Format and Protocol Version 2","author":"Kelsey","key":"10.1016\/j.bcra.2021.100007_bib20"},{"issue":"1","key":"10.1016\/j.bcra.2021.100007_bib21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1515\/jmc-2016-0019","article-title":"On a decentralized trustless pseudo-random number generation algorithm","volume":"11","author":"Popov","year":"2017","journal-title":"J. Math. Cryptol."},{"key":"10.1016\/j.bcra.2021.100007_bib22","series-title":"2017 IEEE Symposium on Security and Privacy (SP); 22\u201326 May 2017; San Jose, CA, USA","first-page":"444","article-title":"Scalable bias-resistant distributed randomness","author":"Syta","year":"2017"},{"key":"10.1016\/j.bcra.2021.100007_bib23","series-title":"Advances in Cryptology \u2013 CRYPTO 2018. CRYPTO 2018","first-page":"757","article-title":"Verifiable delay functions","volume":"vol. 10991","author":"Boneh","year":"2018"},{"key":"10.1016\/j.bcra.2021.100007_bib24","series-title":"SODA \u201991: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms; March 1991; Philadelphia, PA, USA","first-page":"351","article-title":"Optimal time randomized consensus\u2014making resilient algorithms fast in practice","author":"Saks","year":"1991"},{"issue":"1","key":"10.1016\/j.bcra.2021.100007_bib25","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0196-6774(02)00220-1","article-title":"Fast deterministic consensus in a noisy environment","volume":"45","author":"Aspnes","year":"2002","journal-title":"J. Algorithm"},{"year":"1984","series-title":"Clausewitz. On War","author":"von","key":"10.1016\/j.bcra.2021.100007_bib26"},{"issue":"5","key":"10.1016\/j.bcra.2021.100007_bib27","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00446-012-0162-z","article-title":"The correctness proof of Ben-Or\u2019s randomized consensus algorithm","volume":"25","author":"Aguilera","year":"2012","journal-title":"Distr. Comput."},{"key":"10.1016\/j.bcra.2021.100007_bib28","series-title":"Proceedings of the 2nd ACM Annual Symposium on Principles of Distributed Computing; Aug 1983; Montreal, QB, Canada","first-page":"27","article-title":"Another advantage of free choice: completely asynchronous agreement protocols (extended abstract)","author":"Ben-Or","year":"1983"},{"issue":"2","key":"10.1016\/j.bcra.2021.100007_bib29","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. Comput."},{"key":"10.1016\/j.bcra.2021.100007_bib30","series-title":"International Colloquium on Automata, Languages, and Programming; 11\u201315 July 1989","first-page":"341","article-title":"An optimal probabilistic algorithm for synchronous Byzantine agreement","author":"Feldman","year":"1989"},{"issue":"1","key":"10.1016\/j.bcra.2021.100007_bib31","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TDSC.2005.13","article-title":"Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems","volume":"2","author":"Friedman","year":"2005","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.bcra.2021.100007_bib32","series-title":"24th Annual Symposium on Foundations of Computer Science (SFCS 1983); 7\u20139 Nov 1983; Tucson, AZ, USA","first-page":"403","article-title":"Randomized Byzantine generals","author":"Rabin","year":"1983"},{"issue":"1","key":"10.1016\/j.bcra.2021.100007_bib33","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TC.2018.2860009","article-title":"Scalable Byzantine consensus via hardware-assisted secret sharing","volume":"68","author":"Liu","year":"2018","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.bcra.2021.100007_bib34","series-title":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA); 1\u20133 Nov 2018; Cambridge, MA, USA","first-page":"1","article-title":"Dbft: efficient leaderless Byzantine consensus and its application to blockchains","author":"Crain","year":"2018"},{"key":"10.1016\/j.bcra.2021.100007_bib35","series-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security; 24\u201328 Oct 2016; Vienna, Austria","first-page":"31","article-title":"The honey badger of BFT protocols","author":"Miller","year":"2016"},{"issue":"1","key":"10.1016\/j.bcra.2021.100007_bib36","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0921-8890(96)00030-9","article-title":"Consensus formation and the cellular automata","volume":"19","author":"Tanaka-Yamawaki","year":"1996","journal-title":"Robot. Autonom. Syst."},{"issue":"4","key":"10.1016\/j.bcra.2021.100007_bib37","first-page":"289","article-title":"Very effective evolutionary techniques for searching cellular automata rule spaces","volume":"3","author":"Wolz","year":"2008","journal-title":"J. Cell. Automata"},{"author":"Marques-Pita","key":"10.1016\/j.bcra.2021.100007_bib38"},{"key":"10.1016\/j.bcra.2021.100007_bib39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2014.07.026","article-title":"Global majority consensus by local majority polling on graphs of a given degree sequence","volume":"180","author":"Abdullah","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.bcra.2021.100007_bib40","series-title":"LATIN 2018: Theoretical Informatics","first-page":"572","article-title":"Majority model on random regular graphs","volume":"vol. 10807","author":"G\u00e4rtner","year":"2018"},{"issue":"1","key":"10.1016\/j.bcra.2021.100007_bib41","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1016\/j.procs.2010.04.262","article-title":"Statistical mechanics of rumour spreading in network communities","volume":"1","author":"Ostilli","year":"2010","journal-title":"Procedia Computer Science"},{"issue":"6684","key":"10.1016\/j.bcra.2021.100007_bib42","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"10.1016\/j.bcra.2021.100007_bib43","article-title":"Random graphs and complex networks","volume":"vol. 1","author":"van der Hofstad","year":"2016"},{"author":"B\u00fcnz","key":"10.1016\/j.bcra.2021.100007_bib44"},{"key":"10.1016\/j.bcra.2021.100007_bib45","article-title":"On the unbearable lightness of fips 140-2 randomness tests","author":"Hurley-Smith","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["Blockchain: Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2096720921000026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2096720921000026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:15:19Z","timestamp":1761869719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2096720921000026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["S2096720921000026"],"URL":"https:\/\/doi.org\/10.1016\/j.bcra.2021.100007","relation":{},"ISSN":["2096-7209"],"issn-type":[{"type":"print","value":"2096-7209"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robustness and efficiency of voting consensus protocols within byzantine infrastructures","name":"articletitle","label":"Article Title"},{"value":"Blockchain: Research and Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.bcra.2021.100007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 The Authors. Published by Elsevier B.V. on behalf of Zhejiang University Press.","name":"copyright","label":"Copyright"}],"article-number":"100007"}}