Repository logo
 

Making CRDTs Byzantine fault tolerant

Accepted version
Peer-reviewed

Type

Conference Object

Change log

Authors

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.

Description

Keywords

4606 Distributed Computing and Systems Software, 46 Information and Computing Sciences

Journal 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

Journal ISSN

Volume Title

Publisher

ACM
Sponsorship
Isaac Newton Trust (19.08(m))
Leverhulme Trust (ECF-2019-028)
Leverhulme Trust Isaac Newton Trust Nokia Bell Labs