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.

Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast

    This paper presents a simple and efficient reliable broadcast algorithm for asynchronous message-passing systems made up of n processes, among which up to t < n/5 may behave arbitrarily (Byzantine processes). This algorithm requires two communication steps and n21 messages. When compared to Bracha’s algorithm, which is resilience optimal (t < n/3) and requires three communication steps and 2n2  n  1 messages, the proposed algorithm shows an interesting tradeoff between communication efficiency and t-resilience.

    Communicated by J. Beauquier