Practical Client-side Replication: Weak Consistency Semantics for Insecure Settings
Albert van der Linde, João Leitão, Nuno M. Preguiça
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- The LAW theorem: Local Reads and Linearizable Asynchronous ReplicationEmmanouil Giortamis, Antonios Katsarakis, Vasilis Gavrielatos, Pramod Bhatotia et al.VLDB 2025 · 2 citations
- Secure RDTs: Enforcing Access Control Policies for Offline Available JSON DataThierry Renaux, Sam Van den Vonder, Wolfgang De MeuterOOPSLA 2023 · 1 citation
Builds on4
- Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-Order ExecutionJo Van Bulck, Marina Minkin, Ofir Weisse, Daniel Genkin et al.USENIX Security 2018 · 1,175 citations
- ARMageddon: Cache Attacks on Mobile DevicesMoritz Lipp, Daniel Gruss, Raphael Spreitzer, Clémentine Maurice et al.USENIX Security 2016 · 451 citations
- BEAT: Asynchronous BFT Made PracticalSisi Duan, Michael K. Reiter, Haibin ZhangCCS 2018 · 255 citations
- Preventing (Network) Time Travel with ChronosOmer Deutsch, Neta Rozen Schiff, Danny Dolev, Michael SchapiraNDSS 2018 · 17 citations
Related papers
- Integrating 2PC with Consensus for Fast ReplicationYan Chen, Xinyi Yu, Shengyun Liu, Ruofan Xiong et al.SIGCOMM 2026
- UniStore: A fault-tolerant marriage of causal and strong consistencyManuel Bravo, Alexey Gotsman, Borja de Régil, Hengfeng WeiUSENIX ATC 2021 · 1 citation
- CausalMesh: A Causal Cache for Stateful Serverless ComputingHaoran Zhang, Shuai Mu, Sebastian Angel, Vincent LiuVLDB 2024 · 6 citations
- Decidable verification under a causally consistent shared memoryOri Lahav, Udi BokerPLDI 2020 · 30 citations
- Peepco: Batch-Based Consistency OptimizationIvan Kuraj, John K. Feser, Nadia Polikarpova, Armando Solar-LezamaOOPSLA 2025
