GUARDTs: Decentralized Access Control for Replicated Data Types
cs.PL, cs.DC
Submitted: 2026-11-05
Updated: 2026-11-05
Comments: 24 pages, 10 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Replicated data types providing strong eventual consistency offer a principled foundation for developing decentralized software.
Terminology
Abstract
Replicated data types providing strong eventual consistency offer a principled foundation for developing decentralized software. Yet existing approaches to programming such data types leave access control unresolved: they either provide none at all, delegate it to a trusted coordinator, reintroducing the centralization they were designed to avoid, or tie it to specific data-type constructions, while typically assuming non-Byzantine replicas and static policies. We present GUARDTs: Guarded Unforgeable Algebraic Replicated Data Types, which embed fine-grained permissions directly into the application data model, operate without a central authority, support dynamic policy evolution, and tolerate Byzantine replicas. We formally prove that GUARDTs guarantee confidentiality, integrity, and availability and show empirically that their access control adds negligible overhead on top of the cost of Byzantine-resilient replication itself.
Sources
- Analysis of the Matrix Event Graph Replicated Data Type
- Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-Peer Databases
- ACGreGate: A Framework for Practical Access Control for Applications using Weakly Consistent Databases
Related papers
- Formal Verification of an Out-of-Order Multiprocessor against an In-Order Weak-Memory ISA
- Fuss-free cumulative universes: theory and practice
- High-Level Synthesis of Efficient Pipelines with Visibility Control
- Model Checking Probabilistic Multiparty Session Types
- A Type System for Communication-Safe Hardware Design
- RECURSUM: Automated Code Generation for Recurrence Relations Exceeds Expert Optimization via LayeredCodegen