Repository logo

Safety analysis in the NGAC model

Simple item page
dc.contributor.authorTan, Brian, author
dc.contributor.authorDavies, Ewan S. D., author
dc.contributor.authorRay, Indrakshi, author
dc.contributor.authorAbdelgawad, Mahmoud A., author
dc.contributor.authorACM, publisher
dc.date.accessioned2025-09-25T18:39:00Z
dc.date.available2025-09-25T18:39:00Z
dc.date.issued2025-07-07
dc.description.abstractWe study the safety problem for the next-generation access control (NGAC) model. We show that under mild assumptions it is coNP-complete, and under further realistic assumptions we give an algorithm for the safety problem that significantly outperforms naive brute force search. We also show that real-world examples of mutually exclusive attributes lead to nearly worst-case behavior of our algorithm.
dc.format.mediumborn digital
dc.format.mediumarticles
dc.identifier.bibliographicCitationBrian Tan, Ewan S. D. Davies, Indrakshi Ray, and Mahmoud A. Abdelgawad. 2025. Safety Analysis in the NGAC Model. In Proceedings of the 30th ACM Symposium on Access Control Models and Technologies (SACMAT '25), July 8-10, 2025, Stony Brook, NY, USA. ACM, New York, NY, USA, 8 pages. https://doi.org/10.1145/3734436.3734444
dc.identifier.doihttps://doi.org/10.1145/3734436.3734444
dc.identifier.urihttps://hdl.handle.net/10217/242035
dc.languageEnglish
dc.language.isoeng
dc.publisherColorado State University. Libraries
dc.relation.ispartofPublications
dc.relation.ispartofACM DL Digital Library
dc.rights.licenseThis work is licensed under a Creative Commons Attribution 4.0 International License.
dc.rights.urihttps:/creativecommons.org/licenses/by/4.0/
dc.subjectaccess control
dc.subjectnext-generation access control
dc.subjectsafety problem
dc.subjectcomputational complexity
dc.titleSafety analysis in the NGAC model
dc.typeText

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
FACF_ACMOA_3734436.3734444.pdf
Size:
998.1 KB
Format:
Adobe Portable Document Format
Download

Collections

Publications