Inter-ReBAC : Inter-operation of Relationship-Based Access Control Model Instances. / Crampton, Jason; Sellwood, James.

Data and Applications Security and Privacy XXX. Vol. 9766 Springer-Verlag, 2016. p. 96-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9766).

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

E-pub ahead of print

Standard

Inter-ReBAC : Inter-operation of Relationship-Based Access Control Model Instances. / Crampton, Jason; Sellwood, James.

Data and Applications Security and Privacy XXX. Vol. 9766 Springer-Verlag, 2016. p. 96-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9766).

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

Harvard

Crampton, J & Sellwood, J 2016, Inter-ReBAC: Inter-operation of Relationship-Based Access Control Model Instances. in Data and Applications Security and Privacy XXX. vol. 9766, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9766, Springer-Verlag, pp. 96-105, 30th IFIP WG 11.3 Conference on Data and Applications Security, DBSec 2016, Trento, Italy, 18/07/16. https://doi.org/10.1007/978-3-319-41483-6_7

APA

Crampton, J., & Sellwood, J. (2016). Inter-ReBAC: Inter-operation of Relationship-Based Access Control Model Instances. In Data and Applications Security and Privacy XXX (Vol. 9766, pp. 96-105). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9766). Springer-Verlag. https://doi.org/10.1007/978-3-319-41483-6_7

Vancouver

Crampton J, Sellwood J. Inter-ReBAC: Inter-operation of Relationship-Based Access Control Model Instances. In Data and Applications Security and Privacy XXX. Vol. 9766. Springer-Verlag. 2016. p. 96-105. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-41483-6_7

Author

Crampton, Jason ; Sellwood, James. / Inter-ReBAC : Inter-operation of Relationship-Based Access Control Model Instances. Data and Applications Security and Privacy XXX. Vol. 9766 Springer-Verlag, 2016. pp. 96-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{7f2cf1da70c64ab3adf5e7731a702827,
title = "Inter-ReBAC: Inter-operation of Relationship-Based Access Control Model Instances",
abstract = "Relationship-based access control (ReBAC) models, where authorization policies and decisions are made using the relationships which exist between the entities of a modelled system, have attracted considerable attention in recent years. ReBAC can now be applied to general computing environments more diverse and complex than the social networking applications in which ReBAC was first studied. However, up until now ReBAC models have only considered the evaluation of requests made within a single system, and therefore within a single instance of a model.We present a framework through which model instances can inter-operate, such that requests initiated in one system may target resources in a second system. Further, our framework is able to support requests passing through a chain of inter-connected systems, thus enabling many systems to be connected together or a single large system to be decomposed into numerous component subsystems. We choose to develop an inter-operation framework for the RPPM model defined by Crampton and Sellwood. RPPM supports the modelling of general computing environments, to which inter-operation is highly relevant, and employs security principals and a two step authorization process, which are naturally suited to the partitioning of access control processes. However, the underlying motivation and approach of this work are applicable to other relationship-based access control models, although alternative implementations may be required depending on a model's capabilities.",
keywords = "Access control, Authorization, Path condition, Policy graph, Principal activation, Principal matching, Relationship, Secure inter-operation",
author = "Jason Crampton and James Sellwood",
year = "2016",
month = jul,
day = "2",
doi = "10.1007/978-3-319-41483-6_7",
language = "English",
isbn = "978-3-319-41482-9",
volume = "9766",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "96--105",
booktitle = "Data and Applications Security and Privacy XXX",
note = "30th IFIP WG 11.3 Conference on Data and Applications Security, DBSec 2016 ; Conference date: 18-07-2016 Through 20-07-2016",

}

RIS

TY - GEN

T1 - Inter-ReBAC

T2 - 30th IFIP WG 11.3 Conference on Data and Applications Security, DBSec 2016

AU - Crampton, Jason

AU - Sellwood, James

PY - 2016/7/2

Y1 - 2016/7/2

N2 - Relationship-based access control (ReBAC) models, where authorization policies and decisions are made using the relationships which exist between the entities of a modelled system, have attracted considerable attention in recent years. ReBAC can now be applied to general computing environments more diverse and complex than the social networking applications in which ReBAC was first studied. However, up until now ReBAC models have only considered the evaluation of requests made within a single system, and therefore within a single instance of a model.We present a framework through which model instances can inter-operate, such that requests initiated in one system may target resources in a second system. Further, our framework is able to support requests passing through a chain of inter-connected systems, thus enabling many systems to be connected together or a single large system to be decomposed into numerous component subsystems. We choose to develop an inter-operation framework for the RPPM model defined by Crampton and Sellwood. RPPM supports the modelling of general computing environments, to which inter-operation is highly relevant, and employs security principals and a two step authorization process, which are naturally suited to the partitioning of access control processes. However, the underlying motivation and approach of this work are applicable to other relationship-based access control models, although alternative implementations may be required depending on a model's capabilities.

AB - Relationship-based access control (ReBAC) models, where authorization policies and decisions are made using the relationships which exist between the entities of a modelled system, have attracted considerable attention in recent years. ReBAC can now be applied to general computing environments more diverse and complex than the social networking applications in which ReBAC was first studied. However, up until now ReBAC models have only considered the evaluation of requests made within a single system, and therefore within a single instance of a model.We present a framework through which model instances can inter-operate, such that requests initiated in one system may target resources in a second system. Further, our framework is able to support requests passing through a chain of inter-connected systems, thus enabling many systems to be connected together or a single large system to be decomposed into numerous component subsystems. We choose to develop an inter-operation framework for the RPPM model defined by Crampton and Sellwood. RPPM supports the modelling of general computing environments, to which inter-operation is highly relevant, and employs security principals and a two step authorization process, which are naturally suited to the partitioning of access control processes. However, the underlying motivation and approach of this work are applicable to other relationship-based access control models, although alternative implementations may be required depending on a model's capabilities.

KW - Access control

KW - Authorization

KW - Path condition

KW - Policy graph

KW - Principal activation

KW - Principal matching

KW - Relationship

KW - Secure inter-operation

UR - http://www.scopus.com/inward/record.url?scp=84979561829&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-41483-6_7

DO - 10.1007/978-3-319-41483-6_7

M3 - Conference contribution

AN - SCOPUS:84979561829

SN - 978-3-319-41482-9

VL - 9766

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 96

EP - 105

BT - Data and Applications Security and Privacy XXX

PB - Springer-Verlag

Y2 - 18 July 2016 through 20 July 2016

ER -