Abstract
A method is presented for achieving Byzantine agreement among n processors with up to t faults, requiring at most 0(n plus t**2) messages at the expense of extra phases. That is, the number of messages required to reach agreement is reduced from 9(nt) to 9n plus t**2).
| Original language | English |
|---|---|
| Pages (from-to) | 432-433 |
| Number of pages | 2 |
| Journal | IBM technical disclosure bulletin |
| Volume | 26 |
| Issue number | 1 |
| State | Published - 1983 |