{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:50:34Z","timestamp":1752360634653},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"INOCS","award":["RM11715C816CE4CB"],"award-info":[{"award-number":["RM11715C816CE4CB"]}]},{"name":"ESTATE","award":["ANR-16-CE25-0009- 03"],"award-info":[{"award-number":["ANR-16-CE25-0009- 03"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13173-019-0090-x","type":"journal-article","created":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T05:53:53Z","timestamp":1567835633000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Multi-hop Byzantine reliable broadcast with honest dealer made practical"],"prefix":"10.1186","volume":"25","author":[{"given":"Silvia","family":"Bonomi","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Farina","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,7]]},"reference":[{"issue":"21-23","key":"90_CR1","doi-asserted-by":"publisher","first-page":"2110","DOI":"10.1016\/j.tcs.2009.01.041","volume":"410","author":"Roberto Baldoni","year":"2009","unstructured":"Baldoni R, Bonomi S, Querzoni L, Tucci Piergiovanni S (2009) Investigating the existence and the regularity of logarithmic harary graphs. Theor Comput Sci 410(21-23):2110\u20132121. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2009.01.041\n                    \n                  .","journal-title":"Theoretical Computer Science"},{"issue":"5439","key":"90_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"Albert-L\u00e1szl\u00f3 Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. \n                    https:\/\/doi.org\/10.1126\/science.286.5439.509\n                    \n                  .","journal-title":"Science"},{"key":"90_CR3","doi-asserted-by":"publisher","unstructured":"Bonomi S, Farina G, Tixeuil S (2018) Multi-hop byzantine reliable broadcast made practical In: 8th Latin-American Symposium on Dependable Computing, LADC 2018, Foz do Igua\u00e7u, Brazil, October 8-10, 2018, 155\u2013160. \n                    https:\/\/doi.org\/10.1109\/LADC.2018.00026\n                    \n                  .","DOI":"10.1109\/LADC.2018.00026"},{"key":"90_CR4","doi-asserted-by":"publisher","unstructured":"Bonomi S, Farina G, Tixeuil S (2019) Multi-hop byzantine reliable broadcast made practical simulation code. \n                    https:\/\/doi.org\/10.5281\/zenodo.3314359\n                    \n                  . \n                    https:\/\/github.com\/giovannifarina\/BFT-BRB\n                    \n                  .","DOI":"10.5281\/zenodo.3314359"},{"issue":"4","key":"90_CR5","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"Miguel Castro","year":"2002","unstructured":"Castro M, Liskov B (2002) Practical byzantine fault tolerance and proactive recovery. ACM Trans Comput Syst 20(4):398\u2013461. \n                    https:\/\/doi.org\/10.1145\/571637.571640\n                    \n                  .","journal-title":"ACM Transactions on Computer Systems"},{"key":"90_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"Reinhard Diestel","year":"2017","unstructured":"Diestel R (2017) Graph Theory. Springer Berlin Heidelberg. \n                    https:\/\/doi.org\/10.1007\/978-3-662-53622-3\n                    \n                  ."},{"key":"90_CR7","doi-asserted-by":"publisher","unstructured":"Dolev D (1981) Unanimity in an unknown and unreliable environment In: 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, USA, 28-30 October 1981, 159\u2013168. \n                    https:\/\/doi.org\/10.1109\/SFCS.1981.53\n                    \n                  .","DOI":"10.1109\/SFCS.1981.53"},{"key":"90_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"John R. Douceur","year":"2002","unstructured":"Douceur JR (2002) The sybil attack In: Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Cambridge, MA, USA, March 7-8, 2002, Revised Papers, 251\u2013260. \n                    https:\/\/doi.org\/10.1007\/3-540-45748-8_24\n                    \n                  ."},{"key":"90_CR9","doi-asserted-by":"publisher","unstructured":"Drabkin V, Friedman R, Segal M (2005) Efficient byzantine broadcast in wireless ad-hoc networks In: 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June - 1 July 2005, Yokohama, Japan, Proceedings, 160\u2013169. \n                    https:\/\/doi.org\/10.1109\/DSN.2005.42\n                    \n                  .","DOI":"10.1109\/DSN.2005.42"},{"issue":"1","key":"90_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/15M1055024","volume":"31","author":"Andrew Gainer-Dewar","year":"2017","unstructured":"Gainer-Dewar A, Vera-Licona P (2017) The minimal hitting set generation problem: algorithms and computation. SIAM J Discrete Math 31(1):63\u2013100. \n                    https:\/\/doi.org\/10.1137\/15M1055024\n                    \n                  .","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"90_CR11","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co., New York."},{"issue":"4","key":"90_CR12","first-page":"668","volume":"77","author":"DF Hsu","year":"1994","unstructured":"Hsu DF (1994) On container width and length in graphs, groups, and networks\u2013dedicated to professor paul erd\u00f6s on the occasion of his 80th birthday\u2013. IEICE Trans Fundam Electron Commun Comput Sci 77(4):668\u2013680.","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"1-3","key":"90_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(94)90036-1","volume":"133","author":"D. Frank Hsu","year":"1994","unstructured":"Hsu DF, Luczak T (1994) On the k-diameter of k-regular k-connected graphs. Discret Math 133(1-3):291\u2013296. \n                    https:\/\/doi.org\/10.1016\/0012-365X(94)90036-1\n                    \n                  .","journal-title":"Discrete Mathematics"},{"key":"90_CR14","doi-asserted-by":"publisher","unstructured":"Jenkins K, Demers AJ (2001) Logarithmic harary graphs In: 21st International Conference on Distributed Computing Systems Workshops (ICDCS 2001 Workshops), 16-19 April 2001, Phoenix, AZ, USA, Proceedings, 43\u201350. \n                    https:\/\/doi.org\/10.1109\/CDCS.2001.918685\n                    \n                  .","DOI":"10.1109\/CDCS.2001.918685"},{"issue":"4","key":"90_CR15","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"David Kempe","year":"2002","unstructured":"Kempe D, Kleinberg JM, Kumar A (2002) Connectivity and inference problems for temporal networks. J Comput Syst Sci 64(4):820\u2013842. \n                    https:\/\/doi.org\/10.1006\/jcss.2002.1829\n                    \n                  .","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"90_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02019432","volume":"9","author":"L. Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz L, Neumann-Lara V, Plummer M (1978) Mengerian theorems for paths of bounded length. Period Math Hung 9(4):269\u2013276. \n                    https:\/\/doi.org\/10.1007\/bf02019432\n                    \n                  .","journal-title":"Periodica Mathematica Hungarica"},{"issue":"11","key":"90_CR17","doi-asserted-by":"publisher","first-page":"3153","DOI":"10.1016\/j.jpdc.2014.07.010","volume":"74","author":"Alexandre Maurer","year":"2014","unstructured":"Maurer A, Tixeuil S (2014) Byzantine broadcast with fixed disjoint paths. J Parallel Distrib Comput 74(11):3153\u20133160. \n                    https:\/\/doi.org\/10.1016\/j.jpdc.2014.07.010\n                    \n                  .","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"90_CR18","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TPDS.2014.2308190","volume":"26","author":"Alexandre Maurer","year":"2015","unstructured":"Maurer A, Tixeuil S (2015) Containing byzantine failures with control zones. IEEE Trans Parallel Distrib Syst 26(2):362\u2013370. \n                    https:\/\/doi.org\/10.1109\/TPDS.2014.2308190\n                    \n                  .","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"01","key":"90_CR19","doi-asserted-by":"publisher","first-page":"1650003","DOI":"10.1142\/S0129626416500031","volume":"26","author":"Alexandre Maurer","year":"2016","unstructured":"Maurer A, Tixeuil S (2016) Tolerating random byzantine failures in an unbounded network. Parallel Process Lett 26(1). \n                    https:\/\/doi.org\/10.1142\/S0129626416500031\n                    \n                  .","journal-title":"Parallel Processing Letters"},{"key":"90_CR20","doi-asserted-by":"publisher","unstructured":"Maurer A, Tixeuil S, D\u00e9fago X (2015) Communicating reliably in multihop dynamic networks despite byzantine failures In: 34th IEEE Symposium on Reliable Distributed Systems, SRDS 2015, Montreal, QC, Canada, September 28 - October 1, 2015, 238\u2013245. \n                    https:\/\/doi.org\/10.1109\/SRDS.2015.10\n                    \n                  .","DOI":"10.1109\/SRDS.2015.10"},{"key":"90_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.dam.2014.01.012","volume":"170","author":"Keisuke Murakami","year":"2014","unstructured":"Murakami K, Uno T (2014) Efficient algorithms for dualizing large-scale hypergraphs. Discret Appl Math 170:83\u201394. \n                    https:\/\/doi.org\/10.1016\/j.dam.2014.01.012\n                    \n                  .","journal-title":"Discrete Applied Mathematics"},{"issue":"12","key":"90_CR22","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1109\/TPDS.2009.25","volume":"20","author":"M. Nesterenko","year":"2009","unstructured":"Nesterenko M, Tixeuil S (2009) Discovering network topology in the presence of byzantine faults. IEEE Trans Parallel Distrib Syst 20(12):1777\u20131789. \n                    https:\/\/doi.org\/10.1109\/TPDS.2009.25\n                    \n                  .","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"90_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-016-0279-6","volume":"30","author":"Aris Pagourtzis","year":"2016","unstructured":"Pagourtzis A, Panagiotakos G, Sakavalas D (2017) Reliable broadcast with respect to topology knowledge. Distrib Comput 30(2):87\u2013102. \n                    https:\/\/doi.org\/10.1007\/s00446-016-0279-6\n                    \n                  .","journal-title":"Distributed Computing"},{"issue":"3","key":"90_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.10.007","volume":"93","author":"Andrzej Pelc","year":"2005","unstructured":"Pelc A, Peleg D (2005) Broadcasting with locally bounded byzantine faults. Inf Process Lett 93(3):109\u2013115. \n                    https:\/\/doi.org\/10.1016\/j.ipl.2004.10.007\n                    \n                  .","journal-title":"Information Processing Letters"},{"issue":"4","key":"90_CR25","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1017\/S0963548399003867","volume":"8","author":"A. STEGER","year":"1999","unstructured":"Steger A, Wormald NC (1999) Generating random regular graphs quickly. Comb Probab Comput 8(4):377\u2013396. \n                    https:\/\/doi.org\/10.1017\/S0963548399003867\n                    \n                  .","journal-title":"Combinatorics, Probability and Computing"},{"key":"90_CR26","series-title":"Network Theory and Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"Junming Xu","year":"2001","unstructured":"Xu J (2010) Topological structure and analysis of interconnection networks, 1st edn. Springer Publishing Company, Incorporated. \n                    https:\/\/doi.org\/10.1007\/978-1-4757-3387-7\n                    \n                  ."},{"issue":"5","key":"90_CR27","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MWC.2010.5601959","volume":"17","author":"Kai Zeng","year":"2010","unstructured":"Zeng K, Govindan K, Mohapatra P (2010) Non-cryptographic authentication and identification in wireless networks. IEEE Wirel Commun 17(5):56\u201362. \n                    https:\/\/doi.org\/10.1109\/MWC.2010.5601959\n                    \n                  .","journal-title":"IEEE Wireless Communications"}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-019-0090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13173-019-0090-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-019-0090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T10:46:07Z","timestamp":1723545967000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1186\/s13173-019-0090-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,7]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["90"],"URL":"https:\/\/doi.org\/10.1186\/s13173-019-0090-x","relation":{},"ISSN":["0104-6500","1678-4804"],"issn-type":[{"type":"print","value":"0104-6500"},{"type":"electronic","value":"1678-4804"}],"subject":[],"published":{"date-parts":[[2019,9,7]]},"assertion":[{"value":"19 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"9"}}