# Expressiveness and Convertibility of Rule-Based Access Control Policies

DevFeed: [Expressiveness and Convertibility of Rule-Based Access Control Policies](<https://devfeed.tech/articles/expressiveness-and-convertibility-of-rule-based-access-control-policies-143133.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23738>)

Author: Amir Masoumzadeh, Paliath Narendran, Padmavathi Iyer

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Access Control](<https://devfeed.tech/topics/access-control.md>), [Dynamic authorization rules](<https://devfeed.tech/topics/dynamic-authorization-rules.md>), [Authorization](<https://devfeed.tech/topics/authorization.md>)

Tags: [access-control](<https://devfeed.tech/tags/access-control.md>), [computational-complexity](<https://devfeed.tech/tags/computational-complexity.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [migration](<https://devfeed.tech/tags/migration.md>)

## AI overview

The paper proposes a systematic way to compare rule-based access control models whose policies differ in rule structure, composition, conditional-expression features, and support for deny rules. It studies policy semantics, establishes well-formedness properties and an expressiveness hierarchy, and analyzes the computational complexity of converting policies between models. This convertibility question matters for policy migration: a policy in the source model must also be expressible in the target model. The supplied abstract does not specify the hierarchy or complexity results in detail.

## Source excerpt

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.