<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Comparison of Terminological and Rule-based Policy Languages</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Piero A. Bonatti</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Universit`a di Napoli Federico II</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Security and privacy policies commonly consist of declarative constraints over resource usage (data and services). Therefore logic-based representation languages are well-suited as a foundation of policy languages. Indeed, the semantics of standard languages like XACML can be reformulated in a logic-based fashion similar to the encoding adopted in [2]; moreover, both description logics and logic programming languages (i.e., the two main families of knowledge representation formalisms) have been proposed as policy languages, see KAOS, [7], REI [5], RT [6], Cassandra [1], PeerTrust [4], and PROTUNE [3] just to name a few approaches.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In this talk we will assess different knowledge representation formalisms as
policy languages for security and privacy, taking into account not only the kind of
constraints that they can express on resource usage, but also the degree to which
the above reasoning tasks can be supported. We will conclude that currently
rulebased languages are more mature than description logics as far as the general
needs of security and privacy policy languages are concerned.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Moritz</surname>
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Becker</surname>
            and
            <given-names>Peter</given-names>
          </string-name>
          <string-name>
            <surname>Sewell</surname>
          </string-name>
          .
          <article-title>Cassandra: Distributed access control policies with tunable expressiveness</article-title>
          .
          <source>In 5th IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY</source>
          <year>2004</year>
          ), pages
          <fpage>159</fpage>
          -
          <lpage>168</lpage>
          ,
          <string-name>
            <surname>Yorktown</surname>
            <given-names>Heights</given-names>
          </string-name>
          ,
          <string-name>
            <surname>NY</surname>
          </string-name>
          , USA,
          <year>June 2004</year>
          . IEEE Computer Society.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Piero</given-names>
            <surname>Bonatti</surname>
          </string-name>
          , Sabrina De Capitani di Vimercati, and
          <string-name>
            <given-names>Pierangela</given-names>
            <surname>Samarati</surname>
          </string-name>
          .
          <article-title>An algebra for composing access control policies</article-title>
          .
          <source>ACM Trans. Inf. Syst. Secur.</source>
          ,
          <volume>5</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Piero</surname>
            <given-names>A</given-names>
          </string-name>
          . Bonatti and
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Olmedilla</surname>
          </string-name>
          .
          <article-title>Driving and monitoring provisional trust negotiation with metapolicies</article-title>
          .
          <source>In 6th IEEE Policies for Distributed Systems and Networks (POLICY</source>
          <year>2005</year>
          ), pages
          <fpage>14</fpage>
          -
          <lpage>23</lpage>
          , Stockholm, Sweden,
          <year>June 2005</year>
          . IEEE Computer Society.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Rita</given-names>
            <surname>Gavriloaie</surname>
          </string-name>
          , Wolfgang Nejdl, Daniel Olmedilla, Kent E. Seamons, and
          <string-name>
            <given-names>Marianne</given-names>
            <surname>Winslett</surname>
          </string-name>
          .
          <article-title>No registration needed: How to use declarative policies and negotiation to access sensitive resources on the semantic web</article-title>
          .
          <source>In 1st European Semantic Web Symposium (ESWS</source>
          <year>2004</year>
          ), volume
          <volume>3053</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>342</fpage>
          -
          <lpage>356</lpage>
          , Heraklion, Crete, Greece, May
          <year>2004</year>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Lalana</given-names>
            <surname>Kagal</surname>
          </string-name>
          ,
          <string-name>
            <surname>Timothy W. Finin</surname>
            , and
            <given-names>Anupam</given-names>
          </string-name>
          <string-name>
            <surname>Joshi</surname>
          </string-name>
          .
          <article-title>A policy language for a pervasive computing environment</article-title>
          .
          <source>In Policies for Distributed Systems and Networks</source>
          ,
          <source>2003. Proceedings. POLICY 2003. IEEE 4th International Workshop on</source>
          , pages
          <fpage>63</fpage>
          -
          <lpage>74</lpage>
          . IEEE Computer Society,
          <year>June 2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Ninghui</given-names>
            <surname>Li</surname>
          </string-name>
          , John C. Mitchell, and
          <string-name>
            <surname>William</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Winsborough</surname>
          </string-name>
          .
          <article-title>Design of a role-based trust-management framework</article-title>
          .
          <source>In IEEE Symposium on Security and Privacy</source>
          , pages
          <fpage>114</fpage>
          -
          <lpage>130</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>A.</given-names>
            <surname>Uszok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bradshaw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jeffers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Suri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hayes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Breedy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bunch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , S. Kulkarni, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lott</surname>
          </string-name>
          .
          <article-title>Kaos policy and domain services: Toward a description-logic approach to policy representation, deconfliction, and enforcement</article-title>
          .
          <source>In Policies for Distributed Systems and Networks</source>
          ,
          <source>2003. Proceedings. POLICY 2003. IEEE 4th International Workshop on</source>
          , pages
          <fpage>93</fpage>
          -
          <lpage>96</lpage>
          . ACM Press,
          <year>June 2003</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>