Caching and Auditing in the RPPM Model

  • Jason Crampton
  • James Sellwood
Conference paper

DOI: 10.1007/978-3-319-11851-2_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8743)
Cite this paper as:
Crampton J., Sellwood J. (2014) Caching and Auditing in the RPPM Model. In: Mauw S., Jensen C.D. (eds) Security and Trust Management. STM 2014. Lecture Notes in Computer Science, vol 8743. Springer, Cham

Abstract

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.

Keywords

access control path condition relationship principal matching authorization caching auditing separation of duty Chinese Wall 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jason Crampton
    • 1
  • James Sellwood
    • 1
  1. 1.Royal Holloway University of LondonEghamUnited Kingdom

Personalised recommendations