Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time (Q3177735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6912541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time |
scientific article; zbMATH DE number 6912541 |
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
0.9363476037979126
0 references
0.925154447555542
0 references
0.9245773553848268
0 references
0.8326338529586792
0 references
0.8298968076705933
0 references
