{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:13:13Z","timestamp":1649095993969},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2006,3]]},"abstract":"<jats:p> A source sends a piece of data (message), relayed to a receiver by n processes, some of which can be faulty. We assume that the number of faulty processes is at most f and that faulty processes exhibit a Byzantine behavior. A deciding agent has to make a decision concerning the source message, on the basis of results obtained from the receiver. The environment is totally asynchronous. An Asynchronous Byzantine Voting Mechanism is a method that enables the deciding agent to always correctly determine the source message in this scenario. <\/jats:p><jats:p> We show that there exists a correct Asynchronous Byzantine Voting Mechanism if and only if f &lt; n\/3. If this condition is satisfied, we provide such a mechanism. This result should be contrasted with the feasibility of synchronous voting mechansisms, in which the receiver can wait until all fault-free processes convey their values: for this scenario a correct voting mechanism exists whenever f &lt; n\/2. <\/jats:p>","DOI":"10.1142\/s0129626406002496","type":"journal-article","created":{"date-parts":[[2006,3,24]],"date-time":"2006-03-24T06:18:03Z","timestamp":1143181083000},"page":"93-99","source":"Crossref","is-referenced-by-count":1,"title":["VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS"],"prefix":"10.1142","volume":"16","author":[{"given":"ANDRZEJ","family":"PELC","sequence":"first","affiliation":[{"name":"D\u00e9partement d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec J8X 3X7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/6420.6421"},{"key":"rf3","first-page":"1197","volume":"36","author":"Barbara D.","journal-title":"IEEE Transactions on Computers"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0810"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/24.370219"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00064-6"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4223"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/12.223674"},{"key":"rf12","first-page":"848","volume":"16","author":"Preparata F.","journal-title":"IEEE Transactions on Electron. Computers"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1109\/71.262589"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626406002496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:16:37Z","timestamp":1565093797000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626406002496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1142\/S0129626406002496"],"URL":"https:\/\/doi.org\/10.1142\/s0129626406002496","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}