Bell and LaPadula axioms: a “new” paradigm for an “old” model
NSPW '92-93 Proceedings on the 1992-1993 workshop on New security paradigms
A security architecture for computational grids
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Distributed Algorithms
Lattice-Based Access Control Models
Computer
A Flexible Security System for Metacomputing Environments
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
A Resource Management Architecture for Metacomputing Systems
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Cluster and Grid Superservers: The Dawning Experiences in China
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Authorization for Metacomputing Applications
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
A Community Authorization Service for Group Collaboration
POLICY '02 Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks (POLICY'02)
Comments on an access control model in semantic grid
Future Generation Computer Systems
Comments on a theorem on grid access control
Future Generation Computer Systems
A trust degree based access control in grid environments
Information Sciences: an International Journal
Review: Comments on a theorem on grid access control
Future Generation Computer Systems
Comments on an access control model in semantic grid
Future Generation Computer Systems
| Hi-index | 0.00 |
The current grid security research is mainly focused on the authentication of grid systems. A problem to be solved by grid systems is to ensure consistent access control. This problem is complicated because the hosts in a grid computing environment usually span multiple autonomous administrative domains. This paper presents a grid access control model, based on asynchronous automata theory and the classic Bell-LaPadula model. This model is useful to formally study the confidentiality and integrity problems in a grid computing environment. A theorem is proved, which gives the necessary and sufficient conditions to a grid to maintain confidentiality. These conditions are the formalized descriptions of local (node) relations or relationship between grid subjects and node subjects.