General
Expressiveness and Convertibility of Rule-Based Access Control Policies
arXiv cs.CR0 views
arXiv:2611.23738v1 Announce Type: new Abstract: Rule-based access control models such as attribute-based access control support flexible policies based on rules with conditional expressions. The design choices in those models such as what is allowed in the conditional expressions or supporting deny rules may impact the range of the policies that are expressible. In this paper, we propose a systematic approach to investigate the semantics and compare the expressiveness of various rule-based access control models that can be built based on different design choices of rule structure and rule composition. Furthermore, we investigate the problem of convertibility of a policy from one rule-based model to another. This question is critical for policy migration to ensure that a given policy instance in a source model is expressible in a target model. Some of our major results in this paper include well-formedness properties for policy semantics, expressiveness hierarchy of models, and computational complexity of policy convertibility, all having important implications on the design and application of rule-based access control policy models.
Source:https://arxiv.org/abs/2611.23738PreviousJITAtlas: Checking Lifetime and Protection Obligations in Compiler RewritesNextAuthenticating IoT Data on Ethereum after Pectra and Fusaka: A Cost Study of Signature Schemes, Batching and Anchoring for Agricultural Supply Chain Finance
Related posts
Fanatics Promo Code: 10% Off
0Wired
If nobody writes it down, it did not get decided
0dev.to Productivity
Micrograph B-factor estimation via Wilson statistics
0arXiv eess.IV
Greedy Vector Approximation Based on Rotation for Multiplierless Complex Products
0arXiv eess.SP
Toward Massive MIMO HAPS Networks: Antenna Architectures and Design
0arXiv eess.SP
Deep-Learning-Assisted Full Waveform Inversion for Attenuation Reconstruction in Ultrasound Computed Tomography
0arXiv eess.SP