Decentralized data control protects shared info without a central boss

GUARDTs: Decentralized Access Control for Replicated Data Types

Programming LanguagesDistributed, Parallel, and Cluster Computing

Summary

Managing who can see or change shared data without a central controller is a tricky problem, especially when data is copied across many places. The authors present a new way to build data structures that keep track of permissions inside the data itself. This method works even if some copies act badly or policies change over time. Their approach keeps data secure and available, and adding this security doesn’t slow things down much.

What this means in practice

Authors

Christian Kuessner, Ragnar Mogk, Julian Haas, Annette Bieniusa, Mira Mezini

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.