The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
An algebra for composing access control policies
Abstract
Despite considerable advancements in the area of access control and authorization languages, current approaches to enforcing access control are all based on monolithic and complete specifications. This assumption is too restrictive when access control restrictions to be enforced come from the combination of different policy specifications, each possibly under the control of independent authorities, and where the specifics of some component policies may not even be known apriori. Turning individual specifications into a coherent policy to be fed into the access control system requires a nontrivial combination and translation process. This article addresses the problem of combining authorization specifications that may be independently stated, possibly in different languages and according to different policies. We propose an algebra of security policies together with its formal semantics and illustrate how to formulate complex policies in the algebra and reason about them. A translation of policy expressions into equivalent logic programs is illustrated, which provides the basis for the implementation of the algebra. The algebra's expressiveness is analyzed through a comparison with first-order logic.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
(1988) · Cited by 3,452
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101
Lattice-based access control models
Sandhu, R. S. (1993) · Computer · doi:10.1109/2.241422 · Cited by 714
Flexible support for multiple access control policies
Jajodia, S., Samarati, P., Sapino, M. L., & Subrahmanian, V. S. (2001) · ACM Transactions on Database Systems · doi:10.1145/383891.383894 · Cited by 640
Self-citationLifschitz, V., & Turner, H. (1994) · The MIT Press eBooks · doi:10.7551/mitpress/4316.003.0014 · Cited by 349
Handbook of theoretical computer science
Czerbo, D. B. (1992) · Artificial Intelligence in Medicine · doi:10.1016/0933-3657(92)90044-p · Cited by 338
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
Authorization in Distributed Systems: A New Approach1
Woo, T. Y. C., & Lam, S. S. (1993) · Journal of Computer Security · doi:10.3233/jcs-1993-22-304 · Cited by 158
A logic-based knowledge representation for authorization with delegation
Li, N., Feigenbaum, J., & Grosof, B. N. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.1999.779771 · Cited by 100
Cited by
A Survey on Access Control in the Age of Internet of Things
Qiu, J., Tian, Z., Du, C., Zuo, Q., Su, S., & Fang, B. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2969326 · Cited by 458
Semantic-based Automated Reasoning for AWS Access Policies using SMT
Backes, J., Bolignano, P., Cook, B., Dodge, C., Gacek, A., Luckow, K., Rungta, N., Tkachuk, O., & Varming, C. (2018) · 2018 Formal Methods in Computer Aided Design (FMCAD) · doi:10.23919/fmcad.2018.8602994 · Cited by 106
Metadata
- Authors
- Bonatti, P., De Capitani di Vimercati, S., & Samarati, P.
- Venue
- ACM Transactions on Information and System Security
- Published
- 2002-02
- Volume
- 5
- Issue
- 1
- Pages
- 1-35
- ISSN
- 1094-9224 (ISSN-L)
- 1557-7406
- OpenAlex
- W2057345152
- Cited by
- 294
- References
- 14
- FWCI
- 40.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An algebra for composing access control policies. https://app.cochat.ai/papers/10.1145/504909.504910
- The paper
- Bonatti, P., De Capitani di Vimercati, S., & Samarati, P. (2002). An algebra for composing access control policies. ACM Transactions on Information and System Security. https://doi.org/10.1145/504909.504910
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.