Safety Analysis in the NGAC Model
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912371388186624 |
|---|---|
| author | Tan, Brian Davies, Ewan S. D. Ray, Indrakshi Abdelgawad, Mahmoud A. |
| author_facet | Tan, Brian Davies, Ewan S. D. Ray, Indrakshi Abdelgawad, Mahmoud A. |
| contents | We 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_06406 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Safety Analysis in the NGAC Model Tan, Brian Davies, Ewan S. D. Ray, Indrakshi Abdelgawad, Mahmoud A. Computational Complexity Cryptography and Security Computer Science and Game Theory We 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. |
| title | Safety Analysis in the NGAC Model |
| topic | Computational Complexity Cryptography and Security Computer Science and Game Theory |
| url | https://arxiv.org/abs/2505.06406 |