Journal Article10.14778/3407790.3407847
Practical client-side replication: weak consistency semantics for insecure settings
Albert van der Linde,João Leitão,Nuno Preguiça +2 more
- 01 Jul 2020
- Vol. 13, Iss: 12, pp 2590-2605
TL;DR: This paper focuses on how client misbehaviour impacts causal consistency, and proposes a set of techniques for implementing secure consistency models, which exhibit different trade-offs between the application guarantees, and the latency and communication overhead.
read more
Abstract: Client-side replication and direct client-to-client synchronization can be used to create highly available, low-latency interactive applications. Causal consistency, the strongest available consistency model under network partitions, is an attractive consistency model for these applications.This paper focuses on how client misbehaviour impacts causal consistency. We analyze the possible attacks to causal consistency and derive secure consistency models that preclude different types of misbehaviour. We propose a set of techniques for implementing such secure consistency models, which exhibit different trade-offs between the application guarantees, and the latency and communication overhead.Our evaluation shows that secure consistency models impose low overhead when compared with their insecure counterparts, while providing low user-to-user latency and server load compared with traditional client-server architectures. Secure consistency models can be used to enrich server-based architectures with fast and secure peer-to-peer interactions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-Peer Databases.
Martin Kleppmann,Heidi Howard +1 more
TL;DR: This paper introduces an algorithm that guarantees BEC based on Byzantine causal broadcast, proves its correctness, and demonstrates near-optimal performance in a prototype implementation.
22
Making CRDTs Byzantine fault tolerant
Martin Kleppmann
- 05 Apr 2022
TL;DR: This paper shows how to adapt existing non-Byzantine CRDT algorithms and make them Byzantine fault-tolerant, which can tolerate any number of Byzantine nodes, guarantees Strong Eventual Consistency, and requires only modest changes to existingCRDT algorithms.
15
High-availability clusters: A taxonomy, survey, and future directions
TL;DR: In this paper , the authors present the architecture of high availability clusters (HACs) and propose a taxonomy that covers all key aspects of HACs, including deployment patterns, application areas, types of cluster, topology, cluster management, failure detection and recovery, consistency and integrity, and data synchronisation.
BeauForT: Robust Byzantine Fault Tolerance for Client-Centric Mobile Web Applications
TL;DR: BeauForT as discussed by the authors is a browser-based platform for decentralized BFT consensus in client-centric, community-driven applications, tolerating Byzantine replicas, combined with a robust and efficient state-based synchronization protocol.
5
Detecting Causality in the Presence of Byzantine Processes: There is No Holy Grail
14 Dec 2022
TL;DR: In this paper , it was shown that it is impossible to determine causality between events in the presence of even a single Byzantine process when processes communicate by unicasting and when processes commune by broadcasting.
4
References
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
The Sybil Attack
John R. Douceur
- 07 Mar 2002
TL;DR: It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.