Bring Efficient Connotation Expressible Policies to Trust Management

Abstract

Trust Management(TM) aims to provide effective access control in open systems. It enables the resource owners to reason and determine the access permissions on the basis of a collection of distributed authorization knowledge about the requester. However, to be efficient, most current TM approaches are based on DATALOG which can't directly express the connotation of TM authorization policies. Thus these policies are hard to be understood and maintained by human beings. In this paper, we propose a new approach called OT based on the ontology language OWL 2 EL. OT supports the connotation expressible policies and remains efficient since its procedure of compliance checking is provable to be tractable. this paper is supported by grants from 863 High-tech Research and Development Program of China ( 2007AA1204040 and 2007AA1204050).