Signature-free asynchronous byzantine consensus with t < n/3 and o(n <sup>2</sup> ) messages (Q2943606)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Signature-free asynchronous byzantine consensus with t < n/3 and o(n <sup>2</sup> ) messages |
scientific article |
Statements
Signature-free asynchronous byzantine consensus with t < n/3 and o(n <sup>2</sup> ) messages (English)
0 references
3 September 2015
0 references
abstraction
0 references
asynchronous message-passing system
0 references
broadcast abstraction
0 references
Byzantine process
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
