Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time (Q3177735)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time |
scientific article |
Statements
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time (English)
0 references
2 August 2018
0 references
asynchronous message-passing system
0 references
Byzantine process
0 references
broadcast abstraction
0 references
common coin
0 references
consensus
0 references
distributed algorithm
0 references
optimal resilience
0 references
randomized algorithm
0 references
signature-free algorithm
0 references
simplicity
0 references
