Attested append-only memory: making adversaries stick to their word

@inproceedings{Chun2007AttestedAM,
  title={Attested append-only memory: making adversaries stick to their word},
  author={Byung-Gon Chun and Petros Maniatis and Scott Shenker and John D. Kubiatowicz},
  booktitle={SOSP},
  year={2007}
}
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limits to how much can be done with entirely untrusted components; for example, replicated state machines cannot tolerate more than a third of their replica population being Byzantine. In this paper, we investigate how minimal trusted abstractions can push through these hard limits in practical ways. We propose Attested… Expand
CheapBFT: resource-efficient byzantine fault tolerance
TLDR
CheapBFT is presented, a BFT system that tolerates that all but one of the replicas active in normal-case operation become faulty, and which allows the system to safely switch to another, more resilient agreement protocol. Expand
Hybrids on Steroids: SGX-Based High Performance BFT
TLDR
With over 1 million operations per second using only four cores, the evaluation of the Intel SGX-based prototype implementation shows that Hybster makes hybrid state-machine replication a viable option even for today's very demanding critical services. Expand
Troxy: Transparent Access to Byzantine Fault-Tolerant Systems
TLDR
Troxy is proposed, a system which relocates the BFT-specific client-side functionality to the server side, thereby making BFT transparent to legacy clients and reduces the replication cost of BFT for read-heavy workloads by offering an actively maintained cache. Expand
Classifying Trusted Hardware via Unidirectional Communication
TLDR
This paper partitions trusted hardware modules into two different power classes; those that employ shared memory primitives, and those that do not; and describes a useful guarantee on the ability of processes to prevent network partitions, called unidirectionality. Expand
Prophecy: Using History for High-Throughput Fault Tolerance
TLDR
This work eliminates the cost for read-mostly workloads through Prophecy, a system that interposes itself between clients and any replicated service, and derives a distributed variant of Prophecy that achieves the same consistency but without any trusted components. Expand
Small trusted primitives for dependable systems
TLDR
The benefits of using "small," generic trusted primitives to increase the fault-tolerance of replicated systems and archival storage, and to improve the security of email SPAM and click-fraud prevention systems are described. Expand
On the (limited) power of non-equivocation
TLDR
It is shown that it is possible to use non-equivocation to transform any protocol that works under the crash fault model into a protocol that tolerates Byzantine faults, without requiring an increase in the number of processes. Expand
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication
TLDR
This paper partitions trusted hardware modules into two different power classes; those that employ shared memory primitives, and those that do not, and describes a useful guarantee on the ability of processes to prevent network partitions, called unidirectionality. Expand
TrInc: Small Trusted Hardware for Large Distributed Systems
TLDR
This work presents TrInc, a small, trusted component that combats equivocation in large, distributed systems, and provides a new primitive: unique, once-in-a-lifetime attestations. Expand
Asphalion: trustworthy shielding against Byzantine faults
TLDR
Asphalion is introduced, the first theorem prover-based framework for verifying implementations of hybrid systems and protocols, and supports compositional reasoning, e.g., through mechanisms to lift properties about trusted-trustworthy components, to the level of the distributed systems they are integrated in. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 44 REFERENCES
Zyzzyva: speculative Byzantine fault tolerance
TLDR
In Zyzzyva, replicas reply to a client's request without first running an expensive three-phase commit protocol to agree on the order to process requests, making BFT replication practical for a broad range of demanding services. Expand
Practical byzantine fault tolerance and proactive recovery
TLDR
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS. Expand
BASE: using abstraction to improve fault tolerance
TLDR
A replication technique, BASE, is described, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors. Expand
Separating agreement from execution for byzantine fault tolerant services
TLDR
A new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests is described, which reduces replication costs and allows a general privacy firewall architecture to protect confidentiality through replication. Expand
Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
TLDR
This paper argues that BFT2F, an extension to the well-known Castro-Liskov PBFT algorithm, can and should bound the system behavior beyond f failures, and has the same liveness and consistency guarantees as PBFT when no more than f replicas fail. Expand
Using abstraction to improve fault tolerance
TLDR
BFTA is described, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors, and an NFS service is built that allows each replica to run a different operating system. Expand
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
TLDR
HQ is presented, a hybrid Byzantine-fault-tolerant state machine replication protocol that employs a lightweight quorum-based protocol when there is no contention, but uses BFT to resolve contention when it arises and shows that both HQ and the new implementation of BFT scale as f increases. Expand
Practical Byzantine fault tolerance
TLDR
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. Expand
BAR fault tolerance for cooperative services
TLDR
An implementation of BAR-B the first cooperative backup service to tolerate both Byzantine users and an unbounded number of rational users is described, an asynchronous replicated state machine that provides the customary safety and liveness guarantees despite nodes exhibiting both Byzantine and rational behaviors. Expand
Interactive consistency with multiple failure modes
The authors address the problem of reaching Byzantine agreement in a distributed system in the presence of different types of faults and show that significant improvements in reliability andExpand
...
1
2
3
4
5
...