Abstract
We provide the first protocol that solves Byzantine agreement with optimal early stopping (min{f +2, t+1} rounds) and optimal resilience (n > 3t) using polynomial message size and computation. All previous approaches obtained sub-optimal results and used resolve rules that looked only at the immediate children in the EIG (Exponential Information Gathering) tree. At the heart of our solution are new resolve rules that look at multiple layers of the EIG tree.
| Original language | English |
|---|---|
| Title of host publication | STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing |
| Publisher | Association for Computing Machinery |
| Pages | 605-614 |
| Number of pages | 10 |
| ISBN (Electronic) | 9781450335362 |
| DOIs | |
| State | Published - 14 Jun 2015 |
| Event | 47th Annual ACM Symposium on Theory of Computing, STOC 2015 - Portland, United States Duration: 14 Jun 2015 → 17 Jun 2015 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
|---|---|
| Volume | 14-17-June-2015 |
| ISSN (Print) | 0737-8017 |
Conference
| Conference | 47th Annual ACM Symposium on Theory of Computing, STOC 2015 |
|---|---|
| Country/Territory | United States |
| City | Portland |
| Period | 14/06/15 → 17/06/15 |
Bibliographical note
Publisher Copyright:© Copyright 2015 ACM.