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 …

Consensus is a classical distributed systems problem with both theoretical and practical
interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the …

We present two asynchronous Byzantine fault-tolerant state machine replication (BFT)
algorithms, which improve previous algorithms in terms of several metrics. First, they require …

Cloud computing and virtualization technology have revolutionized general-purpose
computing applications in the past decade. The cloud paradigm offers advantages through …

In the past, some research has been done on how to use proactive recovery to build
intrusion-tolerant replicated systems that are resilient to any number of faults, as long as …

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 …

Principles of Ad Hoc Networking presents a systematic introduction to the fundamentals of
ad hoc networks. An ad-hoc network is a small network, especially one with wireless or …

The popularity of wide-area computer services has generated a compelling need for efficient
algorithms that provide high reliability. Byzantine fault-tolerant (BFT) algorithms can be used …

Proactive obfuscation is a new method for creating server replicas that are likely to have
fewer shared vulnerabilities. It uses semantics-preserving code transformations to generate …

Critical infrastructures such as the power grid are essentially physical processes controlled
by computers connected by networks. They're usually as vulnerable as any other …