The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A logical language for expressing authorizations
Abstract
A major drawback of existing access control systems is that they have all been developed with a specific access control policy in mind. This means that all protection requirements (i.e. accesses to be allowed or denied) must be specified in terms of the policy enforced by the system. While this may be trivial for some requirements, specification of other requirements may become quite complex or even impossible. The reason for this is that a single policy simply cannot capture the different protection requirements that users may need to enforce on different data. In this paper, we take a first step towards a model that is able to support different access control policies. We propose a logical language for the specification of authorizations on which such a model can be based. The Authorization Specification Language (ASL) allows users to specify, together with the authorizations, the policy according to which access control decisions are to be made. Policies are expressed by means of rules which enforce the derivation of authorizations, conflict resolution, access control and integrity constraint checking. We illustrate the power of our language by showing how different constraints that are sometimes required, but very seldom supported by existing access control systems, can be represented in our language.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Role-based access control models
Sandhu, R. S., Coyne, E. J., Feinstein, H. L., & Youman, C. E. (1996) · Computer · doi:10.1109/2.485845 · Cited by 5,892
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
The Chinese Wall security policy
Brewer, D. F. C., & Nash, M. J. (2003) · Proceedings. 1989 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1989.36295 · Cited by 882
A unified framework for enforcing multiple access control policies
Jajodia, S., Samarati, P., Subrahmanian, V. S., & Bertino, E. (1997) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/253260.253364 · Cited by 283
Self-citationAuthorization 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 temporal access control mechanism for database systems
Bertino, E., Bettini, C., Ferrari, E., & Samarati, P. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.485637 · Cited by 127
Self-citationAccess meditation in a message passing kernel
Branstad, M., Tajalli, H., Mayer, F., & Dalva, D. (2003) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1989.36278 · Cited by 31
Cited by
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
The Ponder Policy Specification Language
Damianou, N., Dulay, N., Lupu, E., & Sloman, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44569-2_2 · Cited by 1,213
A survey of trust in internet applications
Grandison, T., & Sloman, M. (2000) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2000.5340804 · Cited by 1,157
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-citationA policy language for a pervasive computing environment
Kagal, L., Finin, T., & Joshi, A. (2004) · Proceedings POLICY 2003. IEEE 4th International Workshop on Policies for Distributed Systems and Networks · doi:10.1109/policy.2003.1206958 · Cited by 516
Delegation logic: A logic-based approach to distributed authorization
Li, N., Grosof, B. N., & Feigenbaum, J. (2003) · ACM Transactions on Information and System Security · doi:10.1145/605434.605438 · Cited by 425
Revocations - A classification
Hagstrom, A., Jajodia, S., Parisi-Presicce, F., & Wijesekera, D. (2001) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930135 · Cited by 61
Self-citation
Metadata
- Authors
- Jajodia, S., Samarati, P., & Subrahmanian, V. S.
- Venue
- Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097)
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-22
- Pages
- 31-42
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2144794336
- Cited by
- 427
- References
- 7
- FWCI
- 67.22
- Type
- conference paper
- 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
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.