An optimisation for a two‐round good‐case latency protocol
Abstract Byzantine broadcast is a fundamental primitive in distributed computing. A highly efficient Byzantine broadcast protocol, motivated by the real‐world performance of practical state machine replication protocols, is increasingly needed. This article focuses on the state‐of‐the‐art partially...
Saved in:
Main Authors: | Kexin Hu, Zhenfeng Zhang, Kaiwen Guo, Weiyu Jiang, Xiaoman Li, Jiang Han |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2023-07-01
|
Series: | IET Information Security |
Subjects: | |
Online Access: | https://doi.org/10.1049/ise2.12123 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Multi-duplication fault tolerant scheduling algorithm based on genetic algorithm in heterogeneous systems
by: Zhong-zheng HE, et al.
Published: (2015-07-01) -
Fault Tolerance Model for Hadoop Distributed System
by: Soraya Setti Ahmed, et al.
Published: (2025-01-01) -
Optimized scalable Byzantine fault tolerance algorithm
by: Sicheng HAN, et al.
Published: (2020-06-01) -
Two-layer grouped Byzantine fault tolerance algorithm for UAV swarm
by: Yu CHEN, et al.
Published: (2022-01-01) -
Round reduction-based fault attack on SM4 algorithm
by: Min WANG, et al.
Published: (2016-10-01)