Tan, Brian, authorDavies, Ewan S. D., authorRay, Indrakshi, authorAbdelgawad, Mahmoud A., authorACM, publisher2025-09-252025-09-252025-07-07Brian 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.3734444https://hdl.handle.net/10217/242035We 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.born digitalarticleseng©Brian Tan, et al. ACM 2025. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in SACMAT '25, https://dx.doi.org/10.1145/3734436.3734444.access controlnext-generation access controlsafety problemcomputational complexitySafety analysis in the NGAC modelTexthttps://doi.org/10.1145/3734436.3734444