World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS

    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.

    We show that there exists a correct Asynchronous Byzantine Voting Mechanism if and only if f < 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 < n/2.

    Research partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.

    References