Graph-based delegation authorization in workflow

Using graph transformation as a formalism to specify access control has several advantages, from the intuition provided by the visual aspect to the precise semantics and the systematic verification of constraints. Graph transformations provide a uniform and precise framework for the specification of...

Full description

Saved in:
Bibliographic Details
Main Author: Yonghe Wei
Format: Conference Proceeding
Language:English
Subjects:
Access control
Authorization
Business process re-engineering
CADCAM
Computer aided manufacturing
Cost function
Delegation
Graph
Graph theory
Graph Transformation
Information security
Research and development
Visualization
Workflow
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Using graph transformation as a formalism to specify access control has several advantages, from the intuition provided by the visual aspect to the precise semantics and the systematic verification of constraints. Graph transformations provide a uniform and precise framework for the specification of access control policies. After reviewing the basic notations of graph transformation, this article presents specification formalisms for workflow delegation policies using graph transformation. The authorization states are represented by graphs and state transition by graph transformation. The proposed formalization provides an intuitive description for the manipulation of graph structures as they occur in workflow delegation and a precise specification of consistency conditions on graphs and graph transformations. We specifies a type graph to represents the type information in the graph transformation for workflow delegation, a set of rules to build the system states and sets of positive and negative constraints to specify wanted and unwanted framework.
ISSN:1948-9439
1948-9447
DOI:10.1109/CCDC.2009.5192203