Dissertation/Thesis Abstract

A modal logic for role-based access control within the HOL theorem prover
by Kosiyatrakul, Thumrongsak, Ph.D., Syracuse University, 2010, 463; 3429046
Abstract (Summary)

The access-control logic of Lampson, Abadi, and their colleagues [LABW92, ABLP93] makes it possible to assure the correctness of access-control decisions by accounting correctly for identity, credentials, authority, delegation, and privileges. It can be used to describe a variety of access-control policies and to reason about their access-control decisions. However, it lacks an ability to reason about role-based access control (RBAC) [FSG+01, FBK99, FKC03, SCFY96], which is a popular technique for reducing the administrative complexity of associating users and privileges. This dissertation introduces extensions to the access-control logic that can be used to assure the correctness of RBAC access-control decisions. By implementing and extending the access-control logic in a computer-assisted reasoning tool such as the Higher Order Logic (HOL) theorem prover [GM93], the access-control logic and its extensions are proved to be sound. The result is a tool for design and verification engineers to reason about access-control policies including RBAC.

In this dissertation, we explain how to use the logic to describe RBAC components, such as user assignments, permission assignments, role inheritance, role activations, and users’ requests. We also describe in detail the steps of implementing the access-control logic and its extensions in the HOL theorem prover. Administrative RBAC systems are also explored to see how the HOL theorem prover can be used to formally verify their properties and policies.

Indexing (document details)
Advisor: Chin, Shiu-Kai, Older, Susan
School: Syracuse University
School Location: United States -- New York
Source: DAI-B 71/11, Dissertation Abstracts International
Subjects: Computer Engineering, Computer science
Keywords: Access control, HOL, Role inheritance, Theorem prover, User assignments
Publication Number: 3429046
ISBN: 978-1-124-28900-7
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy