Detecting Incompleteness, Conflicting and Unreachability XACML Policies using Answer Set Programming

Recently, XACML is a popular access control policy language that is used widely in many applications. Policies in XACML are built based on many components over distributed resources. Due to the expressiveness of XACML, it is not trivial for policy administrators to understand the overall effect and...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2015-03
Main Author: Carroline Dewi Puspa Kencana Ramli
Format: Article
Language:English
Subjects:
Access control
Mathematical programming
Policies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Carroline Dewi Puspa Kencana Ramli
description Recently, XACML is a popular access control policy language that is used widely in many applications. Policies in XACML are built based on many components over distributed resources. Due to the expressiveness of XACML, it is not trivial for policy administrators to understand the overall effect and consequences of XACML policies they have written. In this paper we show a mechanism and a tool how to analyses big access control policies sets such as (i) incompleteness policies, (ii) conflicting policies, and (iii) unreachable policies. To detect these problems we present a method using Answer Set Programming (ASP) in the context of XACML 3.0.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2081711048</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2081711048</sourcerecordid><originalsourceid>FETCH-proquest_journals_20817110483</originalsourceid><addsrcrecordid>eNqNil0LAUEYRieliP0PU26p-bDs7baIohTKncbua41mZ5h3Nvn3VvwAV0_nOadFukJKPkrGQnRIhHhjjInJVMSx7JJiBgHyoG1JVzZ31d00bAFxSDNnL0Z_nbIFPVgPKr-qszY6vOgxzTZrunVNogFpjZ8utfgET3cQ6Na70quqau4-aV-UQYh-2yODxXyfLUd37x41YDjdXO1to06CJXzKORsn8r_qDR7TRj4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2081711048</pqid></control><display><type>article</type><title>Detecting Incompleteness, Conflicting and Unreachability XACML Policies using Answer Set Programming</title><source>Publicly Available Content (ProQuest)</source><creator>Carroline Dewi Puspa Kencana Ramli</creator><creatorcontrib>Carroline Dewi Puspa Kencana Ramli</creatorcontrib><description>Recently, XACML is a popular access control policy language that is used widely in many applications. Policies in XACML are built based on many components over distributed resources. Due to the expressiveness of XACML, it is not trivial for policy administrators to understand the overall effect and consequences of XACML policies they have written. In this paper we show a mechanism and a tool how to analyses big access control policies sets such as (i) incompleteness policies, (ii) conflicting policies, and (iii) unreachable policies. To detect these problems we present a method using Answer Set Programming (ASP) in the context of XACML 3.0.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Access control ; Mathematical programming ; Policies</subject><ispartof>arXiv.org, 2015-03</ispartof><rights>2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2081711048?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Carroline Dewi Puspa Kencana Ramli</creatorcontrib><title>Detecting Incompleteness, Conflicting and Unreachability XACML Policies using Answer Set Programming</title><title>arXiv.org</title><description>Recently, XACML is a popular access control policy language that is used widely in many applications. Policies in XACML are built based on many components over distributed resources. Due to the expressiveness of XACML, it is not trivial for policy administrators to understand the overall effect and consequences of XACML policies they have written. In this paper we show a mechanism and a tool how to analyses big access control policies sets such as (i) incompleteness policies, (ii) conflicting policies, and (iii) unreachable policies. To detect these problems we present a method using Answer Set Programming (ASP) in the context of XACML 3.0.</description><subject>Access control</subject><subject>Mathematical programming</subject><subject>Policies</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNil0LAUEYRieliP0PU26p-bDs7baIohTKncbua41mZ5h3Nvn3VvwAV0_nOadFukJKPkrGQnRIhHhjjInJVMSx7JJiBgHyoG1JVzZ31d00bAFxSDNnL0Z_nbIFPVgPKr-qszY6vOgxzTZrunVNogFpjZ8utfgET3cQ6Na70quqau4-aV-UQYh-2yODxXyfLUd37x41YDjdXO1to06CJXzKORsn8r_qDR7TRj4</recordid><startdate>20150309</startdate><enddate>20150309</enddate><creator>Carroline Dewi Puspa Kencana Ramli</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20150309</creationdate><title>Detecting Incompleteness, Conflicting and Unreachability XACML Policies using Answer Set Programming</title><author>Carroline Dewi Puspa Kencana Ramli</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20817110483</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Access control</topic><topic>Mathematical programming</topic><topic>Policies</topic><toplevel>online_resources</toplevel><creatorcontrib>Carroline Dewi Puspa Kencana Ramli</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Carroline Dewi Puspa Kencana Ramli</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Detecting Incompleteness, Conflicting and Unreachability XACML Policies using Answer Set Programming</atitle><jtitle>arXiv.org</jtitle><date>2015-03-09</date><risdate>2015</risdate><eissn>2331-8422</eissn><abstract>Recently, XACML is a popular access control policy language that is used widely in many applications. Policies in XACML are built based on many components over distributed resources. Due to the expressiveness of XACML, it is not trivial for policy administrators to understand the overall effect and consequences of XACML policies they have written. In this paper we show a mechanism and a tool how to analyses big access control policies sets such as (i) incompleteness policies, (ii) conflicting policies, and (iii) unreachable policies. To detect these problems we present a method using Answer Set Programming (ASP) in the context of XACML 3.0.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2015-03
issn 2331-8422
language eng
recordid cdi_proquest_journals_2081711048
source Publicly Available Content (ProQuest)
subjects Access control
Mathematical programming
Policies
title Detecting Incompleteness, Conflicting and Unreachability XACML Policies using Answer Set Programming
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T04%3A00%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Detecting%20Incompleteness,%20Conflicting%20and%20Unreachability%20XACML%20Policies%20using%20Answer%20Set%20Programming&rft.jtitle=arXiv.org&rft.au=Carroline%20Dewi%20Puspa%20Kencana%20Ramli&rft.date=2015-03-09&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2081711048%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20817110483%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2081711048&rft_id=info:pmid/&rfr_iscdi=true