An RDF triple based access authorization specification considering subsumption relationships

RDF and OWL are the primary base technologies for implementing semantic Web. Recently, many researches related with them, or applying them into the other application domains, have been introduced. However, relatively little work has been done for securing the RDF and OWL data. In this paper, we introduce an RDF triple based access authorization specification related with RDF security. Additionally, to efficiently find the authorization conflict by RDF inference, we introduce a method using graph labeling techniques. The problem of authorization conflict by RDF inference is that although the lower concept is permitted to be accessed, it can be inaccessible due to the disapproval for the upper concept. Because by the RDF inference, the lower concept can be interpreted into the upper concept.