Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Fault Tolerance in Distributed Mechanism Design
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following:--An O(log n)-round randomized Byzantine Agreement (BA) protocol in a synchronous fullinformation network tolerating t \le \frac{n} {{3 +\in }} faulty players (for any constant \in \ge 0). As such, our protocol is asymptotically optimal in terms of fault-tolerance. --An O(1)-round randomized BA protocol in a synchronous full-information network tolerating t = O( \frac{n} {{(\log n)^{1.58} }} ) faulty players. --A compiler that converts any randomized protocol \prod\nolimits_{in}designed to tolerate t fail-stop faults, where the source of randomness of \prod\nolimits_{in}is an SV-source, into a protocol \prod\nolimits_{out}that tolerates min(t, \frac{n} {3} ) Byzantine faults. If the round-complexity of \prod\nolimits_{in} is r, that of \prod\nolimits_{out} is O(r log* n). Central to our results is the development of a new tool, "audited protocols". Informally "auditing" is a transformation that converts any protocol that assumes builtin broadcast channels into one that achieves a slightly weaker guarantee, without assuming broadcast channels. We regard this as a tool of independent interest, which could potentially find applications in the design of simple and modular randomized distributed algorithms.