Byzantine fault-tolerant consensus algorithms: A survey

W Zhong, C Yang, W Liang, J Cai, L Chen, J Liao… - Electronics, 2023 - mdpi.com
The emergence of numerous consensus algorithms for distributed systems has resulted from
the swift advancement of blockchain and its related technologies. Consensus algorithms …

Bft in blockchains: From protocols to use cases

X Wang, S Duan, J Clavin, H Zhang - ACM Computing Surveys (CSUR), 2022 - dl.acm.org
A blockchain is a distributed system that achieves strong security guarantees in storing,
managing, and processing data. All blockchains achieve a common goal: building a …

Sharper: Sharding permissioned blockchains over network clusters

MJ Amiri, D Agrawal, A El Abbadi - Proceedings of the 2021 international …, 2021 - dl.acm.org
Scalability is one of the main roadblocks to business adoption of blockchain systems.
Despite recent intensive research on using sharding techniques to enhance the scalability of …

Efficient byzantine fault-tolerance

GS Veronese, M Correia, AN Bessani… - IEEE Transactions …, 2011 - ieeexplore.ieee.org
We present two asynchronous Byzantine fault-tolerant state machine replication (BFT)
algorithms, which improve previous algorithms in terms of several metrics. First, they require …

{ROTE}: Rollback protection for trusted execution

S Matetic, M Ahmed, K Kostiainen, A Dhar… - 26th USENIX Security …, 2017 - usenix.org
Security architectures such as Intel SGX need protection against rollback attacks, where the
adversary violates the integrity of a protected application state by replaying old persistently …

Resilientdb: Global scale resilient blockchain fabric

S Gupta, S Rahnama, J Hellings, M Sadoghi - arxiv preprint arxiv …, 2020 - arxiv.org
Recent developments in blockchain technology have inspired innovative new designs in
resilient distributed and database systems. At their core, these blockchain applications …

{XFT}: Practical fault tolerance beyond crashes

S Liu, P Viotti, C Cachin, V Quéma… - 12th USENIX Symposium …, 2016 - usenix.org
Despite years of intensive research, Byzantine faulttolerant (BFT) systems have not yet been
adopted in practice. This is due to additional cost of BFT in terms of resources, protocol …

Pace: Fully parallelizable bft from reproposable byzantine agreement

H Zhang, S Duan - Proceedings of the 2022 ACM SIGSAC Conference …, 2022 - dl.acm.org
The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and
Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary …

CheapBFT: Resource-efficient Byzantine fault tolerance

R Kapitza, J Behl, C Cachin, T Distler… - Proceedings of the 7th …, 2012 - dl.acm.org
One of the main reasons why Byzantine fault-tolerant (BFT) systems are not widely used lies
in their high resource consumption: 3 f+ 1 replicas are necessary to tolerate only f faults …

DAMYSUS: streamlined BFT consensus leveraging trusted components

J Decouchant, D Kozhaya, V Rahli, J Yu - Proceedings of the …, 2022 - dl.acm.org
Recently, streamlined Byzantine Fault Tolerant (BFT) consensus protocols, such as HotStuff,
have been proposed as a means to circumvent the inefficient view-changes of traditional …