Higher-Order (Temporal) Relationship-Based Access Control

Simple item page
dc.contributor.advisorFong, Philip
dc.contributor.authorArora, Chahal
dc.contributor.committeememberReardon, Joel
dc.contributor.committeememberLi, Simon
dc.date2022-06
dc.date.accessioned2022-02-24T23:11:19Z
dc.date.available2022-02-24T23:11:19Z
dc.date.issued2022-02
dc.description.abstractWith the advent of technologies such as the Internet of Things, new type of relationships have emerged between users and devices. These relationships are transient, which means they can be activated and terminated over time. Existing Relationship-Based Access Control (ReBAC) models are not designed for handling such relationships efficiently. In this work, we present a ReBAC model that can incorporate such transient relationships, thus allowing the creation of access control policies that can use the transient nature of relationships to grant authorization. We call this model Higher-Order (Temporal) Relationship-Based Access Control (HO(T)-ReBAC) model. This thesis formalized the HO(T)-ReBAC model and defined a formal policy language for access control policies in HO(T)-ReBAC. We then discussed case studies based on real-world scenarios where HO(T)-ReBAC can be deployed for authorization decisions. After that, we designed and presented an efficient model implementation that can be used for large-scale projects in the real world. We empirically evaluated our implementation of HO(T)-ReBAC using a real-world social graph and the use case we discussed. Our evaluation found our implementation to be efficient for real-world large-scale projects.en_US
dc.identifier.citationArora, C. (2022). Higher-order (temporal) relationship-based access control (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca.en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/39617
dc.identifier.urihttp://hdl.handle.net/1880/114433
dc.language.isoengen_US
dc.publisher.facultyScienceen_US
dc.publisher.institutionUniversity of Calgaryen
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.en_US
dc.subjectAccess Control Modelen_US
dc.subjectRelationship-Based Access Controlen_US
dc.subjectTransient Relationshipen_US
dc.subjectTemporalityen_US
dc.subjectAllen Relationen_US
dc.subjectPolicy Languageen_US
dc.subjectGraph Matchingen_US
dc.subjectGraph Databaseen_US
dc.subjectConstraint Satisfaction Problemen_US
dc.subject.classificationComputer Scienceen_US
dc.titleHigher-Order (Temporal) Relationship-Based Access Controlen_US
dc.typemaster thesisen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Calgaryen_US
thesis.degree.nameMaster of Science (MSc)en_US
ucalgary.item.requestcopytrueen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ucalgary_2022_arora_chahal.pdf
Size:
924.53 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Open Theses and Dissertations