Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-Peer Databa...
source link: https://arxiv.org/abs/2012.00472
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
[Submitted on 1 Dec 2020]
Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-Peer Databases
Sybil attacks, in which a large number of adversary-controlled nodes join a network, are a concern for many peer-to-peer database systems, necessitating expensive countermeasures such as proof-of-work. However, there is a category of database applications that are, by design, immune to Sybil attacks because they can tolerate arbitrary numbers of Byzantine-faulty nodes. In this paper, we characterize this category of applications using a consistency model we call Byzantine Eventual Consistency (BEC). We introduce an algorithm that guarantees BEC based on Byzantine causal broadcast, prove its correctness, and demonstrate near-optimal performance in a prototype implementation.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK