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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jaehoon KIM, Seog PARK, "RDFacl: A Secure Access Control Model Based on RDF Triple" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 1, pp. 41-50, January 2009, doi: 10.1587/transinf.E92.D.41.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.41/_p
Copy
@ARTICLE{e92-d_1_41,
author={Jaehoon KIM, Seog PARK, },
journal={IEICE TRANSACTIONS on Information},
title={RDFacl: A Secure Access Control Model Based on RDF Triple},
year={2009},
volume={E92-D},
number={1},
pages={41-50},
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.},
keywords={},
doi={10.1587/transinf.E92.D.41},
ISSN={1745-1361},
month={January},}
Copy
TY - JOUR
TI - RDFacl: A Secure Access Control Model Based on RDF Triple
T2 - IEICE TRANSACTIONS on Information
SP - 41
EP - 50
AU - Jaehoon KIM
AU - Seog PARK
PY - 2009
DO - 10.1587/transinf.E92.D.41
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2009
AB - 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.
ER -