Frugal Byzantine Computing

08/03/2021
by   M. K. Aguilera, et al.
0

Traditional techniques for handling Byzantine failures are expensive: digital signatures are too costly, while using 3f+1 replicas is uneconomical (f denotes the maximum number of Byzantine processes). We seek algorithms that reduce the number of replicas to 2f+1 and minimize the number of signatures. While the first goal can be achieved in the message-and-memory model, accomplishing the second goal simultaneously is challenging. We first address this challenge for the problem of broadcasting messages reliably. We consider two variants of this problem, Consistent Broadcast and Reliable Broadcast, typically considered very close. Perhaps surprisingly, we establish a separation between them in terms of signatures required. In particular, we show that Consistent Broadcast requires at least 1 signature in some execution, while Reliable Broadcast requires O(n) signatures in some execution. We present matching upper bounds for both primitives within constant factors. We then turn to the problem of consensus and argue that this separation matters for solving consensus with Byzantine failures: we present a practical consensus algorithm that uses Consistent Broadcast as its main communication primitive. This algorithm works for n=2f+1 and avoids signatures in the common-case – properties that have not been simultaneously achieved previously. Overall, our work approaches Byzantine computing in a frugal manner and motivates the use of Consistent Broadcast – rather than Reliable Broadcast – as a key primitive for reaching agreement.

READ FULL TEXT

page 11

page 13

page 14

research
05/20/2022

Asynchronous Byzantine Reliable Broadcast With a Message Adversary

This paper considers the problem of reliable broadcast in asynchronous a...
research
03/21/2019

Multi-hop Byzantine Reliable Broadcast Made Practical

We revisit Byzantine tolerant reliable broadcast algorithms in multi-hop...
research
08/03/2020

Collaborative Learning as an Agreement Problem

We address the problem of Byzantine collaborative learning: a set of n n...
research
07/26/2020

Optimal Communication Complexity of Byzantine Consensus under Honest Majority

Communication complexity is one of the most important efficiency metrics...
research
04/27/2020

Online Payments by Merely Broadcasting Messages (Extended Version)

We address the problem of online payments, where users can transfer fund...
research
07/03/2018

RT-ByzCast: Byzantine-Resilient Real-Time Reliable Broadcast

Today's cyber-physical systems face various impediments to achieving the...
research
10/10/2020

Relay Protocol for Approximate Byzantine Consensus

This paper presents a novel algorithm for Approximate Byzantine Consensu...

Please sign up or login with your details

Forgot password? Click here to reset