RDFacl: A Secure Access Control Model Based on RDF Triple

Abstract

An expectation for more intelligent Web is recently being reflected through the new research field called Semantic Web. In this paper, related with Semantic Web security, we introduce an RDF triple based access control model having explicit authorization propagation by inheritance and implicit authorization propagation by inference. Especially, we explain an authorization conflict problem between the explicit and the implicit authorization propagation, which is an important concept in access control for Semantic Web. We also propose a novel conflict detection algorithm using graph labeling techniques in order to efficiently find authorization conflicts. Some experimental results show that the proposed detection algorithm has much better performance than the existing detection algorithm when data size and number of specified authorizations become larger.

Cloud Based RDF Security: A Secured Data Model for Cloud Computing

“…The RDF access control framework [17], RDF Security based Framework [18], access control model for securing RDF triples [19] etc., are existing RDF access control methodologies. In any case, the above existing RDF data management procedures don't deal with a lot of data since all the current works are actualized in Jena which isn't productive to scale the colossal measure of data.…”

Authorization Conflict Problems in Combining RIF Rules with RDF Data

“…Recently, related to the problem of securely accessing RDF data, several studies on RDF access control have been conducted [1]- [7]. Among these, the studies presented in [3] and [6] dealt with an authorization conflict problem caused by RDF inference, and explained the problem at a more fine-grained level of the RDF triple. The authorization conflict problem caused by RDF inference can be illustrated by the following simple example.…”

“…Suppose that a user is forbidden to access an RDF triple [s 1 , p 1 1 ]. In our former study [6], we addressed the authorization conflict problem that arises particularly from subsumption inference, which is the key inference in RDF, and suggested an efficient au- thorization conflict detection method that uses graph labeling techniques [8].…”

“…For example, let us consider the RIF rule [$x, p 1 In this paper, we analyze the authorization conflict problem caused by RIF inference, and we suggest an efficient authorization conflict detection algorithm that considers RIF and RDF inferences. The algorithm utilizes the graph labeling-based algorithm suggested in the former study [6].…”

“…However, their suggested conflict detection algorithm is inefficient when RDF data become large and many access authorizations are specified. Therefore, in our former study [6], we adopted a heuristic approach and suggested an efficient authorization conflict detection algorithm based on graph labeling. Jain and Farkas also did not consider the authorization conflict caused by RIF inference.…”