{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:28:58Z","timestamp":1766449738900},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:p> This paper presents a simple and efficient reliable broadcast algorithm for asynchronous message-passing systems made up of n processes, among which up to [Formula: see text] may behave arbitrarily (Byzantine processes). This algorithm requires two communication steps and <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\" altimg=\"eq-00002.gif\"><mml:mrow><mml:msup><mml:mi>n<\/mml:mi><mml:mn>2<\/mml:mn><\/mml:msup><mml:mtext>\u2009<\/mml:mtext><mml:mo>\u2212<\/mml:mo><mml:mtext>\u2009<\/mml:mtext><mml:mn>1<\/mml:mn><\/mml:mrow><\/mml:math> messages. When compared to Bracha\u2019s algorithm, which is resilience optimal ([Formula: see text]) and requires three communication steps and [Formula: see text] messages, the proposed algorithm shows an interesting tradeoff between communication efficiency and t-resilience. <\/jats:p>","DOI":"10.1142\/s0129626416500171","type":"journal-article","created":{"date-parts":[[2016,12,21]],"date-time":"2016-12-21T09:51:42Z","timestamp":1482313902000},"page":"1650017","source":"Crossref","is-referenced-by-count":21,"title":["Trading off <i>t<\/i>-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast"],"prefix":"10.1142","volume":"26","author":[{"given":"Damien","family":"Imbs","sequence":"first","affiliation":[{"name":"LIF, Universit\u00e9 d\u2019Aix-Marseille, 13288 Marseille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[{"name":"Institut Universitaire de France, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,12,21]]},"reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626416500171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:08:18Z","timestamp":1565118498000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626416500171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,12,21]]},"published-print":{"date-parts":[[2016,12]]}},"alternative-id":["10.1142\/S0129626416500171"],"URL":"https:\/\/doi.org\/10.1142\/s0129626416500171","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}