Expressiveness and Convertibility of Rule-Based Access Control Policies

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.23738
Primary Topic
Access Control and Trust
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Expressiveness and Convertibility of Rule-Based Access Control Policies

Amir Masoumzadeh, Padmavathi Iyer, Paliath Narendran
arXiv (Cornell University)
Access Control and Trust
preprint

Expressiveness and Convertibility of Rule-Based Access Control Policies

Amir Masoumzadeh, Padmavathi Iyer, Paliath Narendran
preprint en

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.

arXiv (Cornell University)
Access Control and Trust
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon