Core role-based access control: efficient implementations by transformations

Authors:
Yanhong A. Liu;Chen Wang;Michael Gorbovitski;Tom Rothamel;Yongxi Cheng;Yingchao Zhao;Jing Zhang
Affiliations:
State University of New York at Stony Brook;Tsinghua University;State University of New York at Stony Brook;State University of New York at Stony Brook;Tsinghua University;Tsinghua University;Tsinghua University
Venue:
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Year:
2006

Citing 16
Cited 5

A security model for military message systems

ACM Transactions on Computer Systems (TOCS)
INC: a language for incremental computations

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Z notation: a reference manual

The Z notation: a reference manual
Transformational design and implementation of a new efficient solution to the ready simulation problem

Science of Computer Programming
The formal reconstruction and speedup of the linear time fragment of Willard's relational calculus subset

Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Formal specification for role based access control user/role and role/role relationship management

RBAC '98 Proceedings of the third ACM workshop on Role-based access control
The NIST model for role-based access control: towards a unified standard

RBAC '00 Proceedings of the fifth ACM workshop on Role-based access control
Rebuttal to the NIST RBAC model proposal

RBAC '00 Proceedings of the fifth ACM workshop on Role-based access control
Finite Differencing of Computable Expressions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proposed NIST standard for role-based access control

ACM Transactions on Information and System Security (TISSEC)
Expression continuity and the formal differentiation of algorithms

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Inductively computable constructs in very high level languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Finite Differencing - Part I

ESOP '90 Proceedings of the 3rd European Symposium on Programming
Induction variables in very high level languages

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Incrementalization across object abstraction

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Integrative security management for web-based enterprise applications

WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management

Generating incremental implementations of object-set queries

GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
A language and framework for invariant-driven transformations

GPCE '09 Proceedings of the eighth international conference on Generative programming and component engineering
An empirical assessment of approaches to distributed enforcement in role-based access control (RBAC)

Proceedings of the first ACM conference on Data and application security and privacy
Composing transformations for instrumentation and optimization

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
From clarity to efficiency for distributed algorithms

Proceedings of the ACM international conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a transformational method applied to the core component of role-based access control (RBAC), to derive efficient implementations from a specification based on the ANSI standard for RBAC. The method is based on the idea of incrementally maintaining the result of expensive set operations, where a new method is described and used for systematically deriving incrementalization rules. We calculate precise complexities for three variants of efficient implementations as well as for a straightforward implementation based on the specification. We describe successful prototypes and experiments for the efficient implementations and for automatically generating efficient implementations from straightforward implementations.