Asynchronous BFT Storage with 2t+1 Data Replicas
Christian Cachin, Dan Dobre, Marko Vukolic

TL;DR
This paper introduces MDStore, an asynchronous Byzantine Fault Tolerant storage protocol that significantly reduces data replica count to 2t+1 while maintaining strong consistency and fault tolerance, using lightweight cryptography.
Contribution
MDStore is the first asynchronous BFT storage protocol to minimize data replicas to 2t+1, employing a novel timestamped storage abstraction for wait-free, multi-writer, multi-reader atomic semantics.
Findings
Reduces data replicas from 3t+1 to 2t+1 in asynchronous BFT storage.
Proves a lower bound of 2t+1 data replicas for fault-tolerant storage.
Uses only lightweight cryptographic hash functions for security.
Abstract
The cost of Byzantine Fault Tolerant (BFT) storage is the main concern preventing its adoption in practice. This cost stems from the need to maintain at least 3t+1 replicas in different storage servers in the asynchronous model, so that t Byzantine replica faults can be tolerated. In this paper, we present MDStore, the first fully asynchronous read/write BFT storage protocol that reduces the number of data replicas to as few as 2t+1, maintaining 3t+1 replicas of metadata at (possibly) different servers. At the heart of MDStore store is its metadata service that is built upon a new abstraction we call timestamped storage. Timestamped storage both allows for conditional writes (facilitating the implementation of a metadata service) and has consensus number one (making it implementable wait-free in an asynchronous system despite faults). In addition to its low data replication factor,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Data Storage Technologies · Optimization and Search Problems
