Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
High assurance discretionary access control for object bases
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Role-Based Access Control Models
Computer
A lattice model of secure information flow
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Lattice-Based Access Control Models
Computer
A Role-Based Access Control for Intranet Security
IEEE Internet Computing
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Role-Based Access Control
Information Flow Control in Role-Based Model for Distributed Objects
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Concurrency Control Based-on Significancy on Roles
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
Role-Based Concurrency Control for Distributed Systems
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Concurrency Control using Subject- and Purpose-Oriented (SPO) View
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
| Hi-index | 0.00 |
Information systems have to be consistent and secure in presence of multiple conflicting transactions. The role-based access control model is widely used to keep information systems secure. Here, a role is a set of access rights, i.e. permissions. A subject is granted a family of roles, i.e. one or more than one role. A subject s is allowed to issue a method op to an object o only if an access right 〈o, op〉 is included in the roles granted to the subject s. In the access control models, even if every access request satisfies the access rules, illegal information flow might occur as well known confinement problem. In this paper, we define a legal information flow relation (R1 ⇒ R2) among a pair of role families R1 and R2. This means, no illegal information flow occur if a transaction T1 with a role family R1 is performed prior to another transaction T2 with R2. In addition, we define which role families are more significant than others in terms of types of methods and security classes of objects. Conflicting methods from different transactions are totally ordered in the significancy of roles of the transactions. We discuss how to synchronize transactions so as to prevent illegal information flow and how to serialize conflicting methods from multiple transactions in terms of significancy and information flow relation of roles families.