Comparison of Access Control Approaches for Graph-Structured Data

Description

Access control is the enforcement of the authorization policy, which defines subjects, resources, and access rights. Graph-structured data requires advanced, flexible, and fine-grained access control due to its complex structure as sequences of alternating vertices and edges. Several research works focus on protecting property graph-structured data, enforcing fine-grained access control, and proving the feasibility and applicability of their concept. However, they differ conceptually and technically. To gain a profound overview of the current state of research, we study works from our systematic literature review on authorization and access control for different database models in addition to recent ones. Based on defined criteria, we exclude research works which do not protect graph-structured data, have coarse-grained approaches, consider models other than the property graph model, or have no proof-of-concept implementation. The latest version of the remaining works are discussed in detail in terms of their access control approach as well as authorization policy definition and enforcement. Finally, we analyze the strengths and limitations of the selected works and provide a comparison with respect to different aspects, including the base access control model, open/closed policy, negative permission support, and datastore-independent enforcement.

Period	10 Jul 2024
Event title	21st International Conference on Security and Cryptography
Event type	Conference
Location	FranceShow on map