Separating Data and Control: Asynchronous BFT Storage with 2t + 1 Data Replicas

@article{Cachin2013SeparatingDA,
  title={Separating Data and Control: Asynchronous BFT Storage with 2t + 1 Data Replicas},
  author={Christian Cachin and Daniela Dobre and Marko Vukolic},
  journal={ArXiv},
  year={2013},
  volume={abs/1305.4868}
}
The cost of Byzantine Fault Tolerant (BFT) storage is the main concern preventing its adoption in practice. [] Key Method In addition to its low data replication factor, MDStore offers very strong guarantees implementing multi-writer multi-reader atomic wait-free semantics and tolerating any number of Byzantine readers and crash-faulty writers. We further show that MDStore data replication overhead is optimal; namely, we prove a lower bound of 2t + 1 on the number of data replicas that applies even to crash…
View PDF on arXiv
13 Citations
Highly Influential Citations
1
Background Citations
10
Methods Citations
3

13 Citations

Proofs of Writing for Robust Storage

This paper implemented PoWerStore, a robust and efficient data storage protocol, and shows its improved performance when compared to state of the art robust storage protocols, including protocols that tolerate only crash faults.

Hybris: Robust Hybrid Cloud Storage

Hybris key-value store is presented, the first robust hybrid cloud storage system, aiming at addressing security, reliability, and consistency concerns leveraging both private and public cloud resources, and significantly outperforms comparable multi-cloud storage systems.

Erasure-Coded Byzantine Storage with Separate Metadata

A solution that combines the strongest properties in terms of availability, consistency, fault-tolerance, storage complexity, and concurrency has been elusive so far.

Composable and Robust Outsourced Storage

A novel definition for auditable storage, capturing the guarantee that a successful audit implies that the current server state allows the client to retrieve his data, and develops an audit mechanism, based on secure and robust outsourcing schemes, that is universally composable and fault-tolerant.

Hardening Cassandra Against Byzantine Failures

An analysis of Cassandra's vulnerabilities is presented and protocols for hardening Cassandra against Byzantine failures are proposed, supporting design choices and incremental performance analysis for algorithmic and cryptographic adjustments.

Practical State Machine Replication with Confidentiality

  • Sisi DuanHaibin Zhang
  • Computer Science, Mathematics
    2016 IEEE 35th Symposium on Reliable Distributed Systems (SRDS)
  • 2016
This work addresses the problem of how to store and process data privately in cloud environments that employ state machine replication by presenting a new protocol that is secure in the stronger model that is formalized.

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

This paper surveys important works on fault-tolerant consensus in message-passing networks, and the focus is on results from the past decade, and categorizes the results into new problem formulations and practical applications.

Anticipating Requests to Improve Performance and Reduce Costs in Cloud Storage

This paper presents a technique that anticipates requests in order to reduce the cost of Byzantine fault tolerance and shows that this technique improves the performance in comparison with related works and maintains the desired data reliability.

Probabilistic Byzantine Tolerance for Cloud Computing

Several reputation management policies are studied, including the one used by BOINC as well as a couple of novel ones, in terms of their impact of the possible damage inflicted on the system by various Byzantine behavior strategies, and some encouraging insights are reported.

Distributed storage system based on permissioned blockchain

This paper uses a blockchain to form verifiable contracts between clients and storage providers, specifying what should be stored, and when stored data can be deleted, and utilizes a lightweight proof-of-storage mechanism to verify availability of stored data.

References

SHOWING 1-10 OF 50 REFERENCES

On limitations of using cloud storage for data replication

This paper uses the consensus number of a shared storage abstraction as a measure for its power to facilitate the implementation of data replication, and demonstrates that a KVS is a very simple primitive, not different from read/write registers in this sense, and that a replica capable of the typical operations on timestamped data is fundamentally more powerful than aKVS.

Minimal Byzantine Storage

A new algorithm that uses a "Listeners" pattern of network communication to detect and resolve ordering ambiguities created by concurrent accesses to the system and provides atomic consistency semantics, which is stronger than the regular or pseudo-atomic semantics provided by these existing protocols.

CheapBFT: resource-efficient byzantine fault tolerance

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.

Efficient Replication of Large Data Objects

A new distributed data replication algorithm tailored especially for large-scale read/write data objects such as files that guarantees atomic data consistency, while incurring low latency costs.

Byzantine disk paxos: optimal resilience with byzantine shared memory

Lower bounds are shown on the number of invocation rounds required for optimal resilience reliable register constructions, or more generally, constructions that use less than 4t + 1 fault-prone registers, and on the t-tolerant regular registers constructed in this model.

Lucky Read/Write Access to Robust Atomic Storage

This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions, and determines the exact conditions under which a lucky operation can be fast, namely expedited in one-communication round-trip with no data authentication.

How fast can a very robust read be?

A 2 communication round-trip lower bound for reading from a safe storage that uses at most 2t+2b base objects is proved, independently of the number or round-trips needed by the writer.

Efficient Byzantine Fault-Tolerance

Two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics, and can have better throughput than Castro and Liskov's PBFT, and better latency in networks with nonnegligible communication delays.

Gnothi: Separating Data and Metadata for Efficient and Available Storage Replication

Gnothi, a block replication system that separates data from metadata to provide efficient and available storage replication, can provide about 100- 200% higher throughput, while still retaining the same recovery time and while guaranteeing that recovery eventually completes.

Separating agreement from execution for byzantine fault tolerant services

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.