Abstract
A plethora of Relationship-Based Access Control (ReBAC) models have been proposed, varying in the types of policies they can express. This fragmentation has stifled the creation of a benchmark to directly compare the performance of ReBAC systems based on their common supported policies. To solve this problem, we propose RACON, a schema-driven, customisable ReBAC policy generator. RACON generates policies in an intermediate language subsuming the features required to encode existing ReBAC models. This language can subsequently be translated to popular ReBAC policy languages through an extensible translation module. Taking a view of ReBAC policies as graph queries, we implement translations into two popular graph query languages, namely Cypher and SPARQL.
Original language | English |
---|---|
Title of host publication | SACMAT 2022 - Proceedings of the 27th ACM Symposium on Access Control Models and Technologies |
Publisher | Association for Computing Machinery, Inc. |
Pages | 263-265 |
Number of pages | 3 |
ISBN (Electronic) | 9781450393577 |
DOIs | |
Publication status | Published - 7 Jun 2022 |
Event | 27th ACM Symposium on Access Control Models and Technologies, SACMAT 2022 - Virtual, Online, United States Duration: 8 Jun 2022 → 10 Jun 2022 |
Conference
Conference | 27th ACM Symposium on Access Control Models and Technologies, SACMAT 2022 |
---|---|
Country/Territory | United States |
City | Virtual, Online |
Period | 8/06/22 → 10/06/22 |
Bibliographical note
Publisher Copyright:© 2022 Owner/Author.
Keywords
- benchmark
- policy generation
- relationship-based access control