Caching and Auditing in the RPPM Model

Jason Crampton, James Sellwood

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Crampton and Sellwood recently introduced a variant of relationship-based access control based on the concepts of relationships, paths and principal matching, to which we will refer as the RPPM model. In this paper, we show that the RPPM model can be extended to provide support for caching of authorization decisions and enforcement of separation of duty policies. We show that these extensions are natural and powerful. Indeed, caching provides far greater advantages in RPPM than it does in most other access control models and we are able to support a wide range of separation of duty policies.
Original languageEnglish
Title of host publicationSecurity and Trust Management - 10th International Workshop
Number of pages16
ISBN (Electronic)978-3-319-11851-2
ISBN (Print)978-3-319-11850-5
Publication statusPublished - 2014

Publication series

NameLecture Notes in Computer Science

Cite this