A Theorem on Grid Access Control

The current grid security research is mainly focused onthe authentication of grid systems. A problem to be solved by gridsystems is to ensure consistent access control. This problem iscomplicated because the hosts in a grid computing environment usuallyspan multiple autonomous administrative domains. This paper presents agrid access control model, based on asynchronous automata theory andthe classic Bell-LaPadula model. This model is useful to formally studythe confidentiality and integrity problems in a grid computingenvironment. A theorem is proved, which gives the necessary andsufficient conditions to a grid to maintain confidentiality. Theseconditions are the formalized descriptions of local (node) relations orrelationship between grid subjects and node subjects.