Making CRDTs Byzantine fault tolerant
View / Open Files
Authors
Publication Date
2022-04-05Journal Title
Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data
Conference Name
EuroSys '22: Seventeenth European Conference on Computer Systems
Publisher
ACM
Type
Conference Object
This Version
AM
Metadata
Show full item recordCitation
Kleppmann, M. (2022). Making CRDTs Byzantine fault tolerant. Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data https://doi.org/10.1145/3517209.3524042
Abstract
It is often claimed that Conflict-free Replicated Data Types (CRDTs) ensure consistency of replicated data in peer-to-peer systems. However, peer-to-peer systems usually consist of untrusted nodes that may deviate from the specified protocol (i.e. exhibit Byzantine faults), and most existing CRDT algorithms cannot guarantee consistency in the presence of such faults. This paper shows how to adapt existing non-Byzantine CRDT algorithms and make them Byzantine fault-tolerant. The proposed scheme can tolerate any number of Byzantine nodes (making it immune to Sybil attacks), guarantees Strong Eventual Consistency, and requires only modest changes to existing CRDT algorithms.
Sponsorship
Leverhulme Trust
Isaac Newton Trust
Nokia Bell Labs
Funder references
Isaac Newton Trust (19.08(m))
Leverhulme Trust (ECF-2019-028)
Embargo Lift Date
2023-04-05
Identifiers
External DOI: https://doi.org/10.1145/3517209.3524042
This record's URL: https://www.repository.cam.ac.uk/handle/1810/334681
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.