Multi-hop Byzantine reliable broadcast with honest dealer made practical
Abstract We revisit Byzantine-tolerant reliable broadcast with honest dealer algorithms in multi-hop networks. To tolerate Byzantine faulty nodes arbitrarily spread over the network, previous solutions require a factorial number of messages to be sent over the network if the messages are not authent...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Computação
2019-09-01
|
| Series: | Journal of the Brazilian Computer Society |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13173-019-0090-x |