Byzantine fault-tolerant state-machine replication from a systems perspective

T Distler - ACM Computing Surveys (CSUR), 2021 - dl.acm.org
Byzantine fault-tolerant (BFT) state-machine replication makes it possible to design systems
that are resilient against arbitrary faults, a requirement considered crucial for an increasing …

Key management for beyond 5G mobile small cells: A survey

M De Ree, G Mantas, A Radwan, S Mumtaz… - IEEE …, 2019 - ieeexplore.ieee.org
The highly anticipated 5G network is projected to be introduced in 2020. 5G stakeholders
are unanimous that densification of mobile networks is the way forward. The densification …

Kee** authorities" honest or bust" with decentralized witness cosigning

E Syta, I Tamas, D Visher, DI Wolinsky… - … IEEE Symposium on …, 2016 - ieeexplore.ieee.org
The secret keys of critical network authorities--such as time, name, certificate, and software
update services--represent high-value targets for hackers, criminals, and spy agencies …

Practical byzantine fault tolerance and proactive recovery

M Castro, B Liskov - ACM Transactions on Computer Systems (TOCS), 2002 - dl.acm.org
Our growing reliance on online services accessible on the Internet demands highly
available systems that provide correct service without interruptions. Software bugs, operator …

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 …

The bedrock of byzantine fault tolerance: A unified platform for {BFT} protocols analysis, implementation, and experimentation

MJ Amiri, C Wu, D Agrawal, A El Abbadi… - … USENIX Symposium on …, 2024 - usenix.org
Byzantine Fault-Tolerant (BFT) protocols cover a broad spectrum of design dimensions from
infrastructure settings, such as the communication topology, to more technical features, such …

Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography

C Cachin, K Kursawe, V Shoup - Proceedings of the nineteenth annual …, 2000 - dl.acm.org
Byzantine agreement requires a set of parties in a distributed system to agree on a value
even if some parties are corrupted. A new protocol for Byzantine agreement in a completely …

Survivable zero trust for cloud computing environments

L Ferretti, F Magnanini, M Andreolini, M Colajanni - Computers & Security, 2021 - Elsevier
The security model relying on the traditional defense of the perimeter cannot protect modern
dynamic organizations. The emerging paradigm called zero trust proposes a modern …

Fault-scalable Byzantine fault-tolerant services

M Abd-El-Malek, GR Ganger, GR Goodson… - ACM SIGOPS …, 2005 - dl.acm.org
A fault-scalable service can be configured to tolerate increasing numbers of faults without
significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that …

Separating agreement from execution for byzantine fault tolerant services

J Yin, JP Martin, A Venkataramani, L Alvisi… - Proceedings of the …, 2003 - dl.acm.org
We describe a new architecture for Byzantine fault tolerant state machine replication that
separates agreement that orders requests from execution that processes requests. This …