<!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>Model-Based Policy Derivation for Usage Control Enforcement</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>kumari@cs.tum.edu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Technische Universita ̈t Mu ̈nchen</institution>
          ,
          <addr-line>Germany Supervisor: Prof. Dr. Alexander Pretschner, TUM</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Usage control is concerned with how data is used after access to it has been granted. In existing usage control enforcements, policies are assumed to exist; the derivation of implementation-level policies from end user specification-level policies has not been looked into. The behaviour users expect from a usage controlled system, may therefore differ from the actual behaviour. This research fills this gap. The thesis is that it is possible to adaptively derive implementation-level policies from specification-level policies in the context of usage control with limited input from system administrators (and no input from end users for the derivation of policies) in distributed systems. Policy derivation uses a model-based refinement of domain-specific abstractions like data and action in terms of technical constructs like events and states of systems. A methodological guidance to achieve this translation in a semi-automated way is also discussed.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Usage control [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] is an extension of access control that puts conditions on the
future usage of data. At the level of end users, such requirements are expressed
in abstract terms, for example, “picture may not be printed” or “document may
not be distributed”. Several enforcements of usage control exist for various policy
languages [
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6 ref7">3–7</xref>
        ] and at different layers of abstraction in the system [
        <xref ref-type="bibr" rid="ref10 ref11 ref8 ref9">8–11</xref>
        ]. These
solutions focus on the enforcement of the policies and do not look into
specification, translation, conflicts and other policy-related issues. In other words, they
assume the policies to somehow exist and enable the enforcement of them. Such
solutions have a drawback that system implementations of usage control policies
might not always adequately reflect end user requirements. This is due to several
reasons, one of which is the problem of mapping concepts in the end user’s
domain to technical events and artifacts. For instance, semantics of basic operators
such as “copy” or “delete”, which are fundamental for specifying policies, tend
to vary according to context. For this reason they might be mapped to
incomplete or incorrect sets of system events in enforcement. This might allow events
that should have been inhibited and might wrongly block those that should have
been allowed. I fill this gap by addressing the translation of specification-level
policies into implementation-level policies in the context of the usage control
model introduced in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and later extended in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Enforcement of policies and
related guarantees are not in the scope of this work.
      </p>
      <p>
        The problem. Usage control policies are specified as temporal and cardinality
constraints on user actions on data. In order to translate specification-level
policies, we need, firstly, to define the meaning of actions on data in technical terms.
Secondly, because specification-level policies tend to be formulated in terms of
the future usage of data, we need to transform the constraints to their past
forms [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]; otherwise, the system would need to be able to look into the future.
Thirdly, a well-defined methodology is required to automate the translation.
The solution. To address the first challenge, I propose a domain meta-model
that captures the relationships among different artifacts in any domain, at
different levels of technical details (step 1). This meta-model is then combined
with an existing usage control model to formalize policy derivation (step 2).
The second challenge, the translation of constraints, is essentially the problem
of deriving past-time rules. As there is no generic way to formulate this
derivation, this part of policy translation is handled via fixed rules. To go from policies
to event-condition-action rules (that are finally deployed), predefined templates
are used. The methodological aspects of policy derivation are addressed in step
3 which runs parallel to step 1 and 2. Till step 3 however, I do not take into
account the fact that the domain structure changes over time. Though unrealistic,
this assumption is reasonable in order to simplify the problem for initial results.
Step 4, which is also a part of the methodological aspect of the problem, handles
the dynamic domain structure and describes the adaptive policy translation.
      </p>
      <p>The rest of this paper is structured as follows: §2 argues about the relevance of
this work with respect to related work; §3 discusses the general research
methodology and briefly describes the results published so far. §4 discusses the current
status and the approach to complete the thesis and, §5 concludes.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work &amp; Relevance</title>
      <p>
        The goal of this work is to achieve a model-based derivation of policies
in the context of usage control. In general, this aims to fill the gap between
user and system requirements which is a fundamental problem in the area of
Requirements Engineering. There are several approaches in the literature based
on goals, models, clasifications, ontologies etc. that attempt to fill this gap by
distinguishing between the user-level abstractions and the corresponding
technical constructs at system levels. Some researchers have also addressed policy
derivation targeting issues like conflict prevention, where the focus has been on
the refinement of constraints rather than resources, objects or events [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>
        Some of the prominent work on policy derivation have used resource
hierarchies [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], commitment/obligations analysis [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], goal decomposition [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]
and data classification [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. In the context of action refinement, in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]
and [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], ontology-based refinement techniques are described for semi-automated
translation of access control policies. This is similar to my action refinement
model because of the hierarchical structure of the resources considered.
However, their policies are refined from the abstract level (users, resources and
applications) to the logical level (user ids, resource addresses and computational
commands like read/write); further technical representations of policy elements
in concrete systems are not considered. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] also addresses action decomposition
for policy refinement: subjects perform operations on targets (services and
devices) which are specified at a higher level. Using a system model and a set of
refinement rules, actions are decomposed and one higher level policy is refined
into multiple policies. In the context of giving meanings to abstract actions,
although secure deletion is covered in [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], there is no further discussion on the
different interpretations of deletion. In contrast to these works, I give a formal
definition of policy refinement along with a generic way of modeling semantics of
actions like “copy” and “delete”. My approach is to classify the abstract and the
concrete elements according to the technical details into different models and
perform transformations on the elements of these models.
      </p>
      <p>
        In the context of usage control, the only known work on policy derivation
is described in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. A major difference with my work however is the absence of
a generic and formal definition of the refinements. Other existing work on usage
control, as mentioned in §2, focus on the enforcement part, derivation of policies
from specification to implementation levels has not been addressed.
      </p>
      <p>Contribution. Firstly, this work provides a formal definition of policy
derivation and a generic way to model high-level actions like copy and delete for
security policies, specifically, usage control policies. Secondly, along with adding to
the expressiveness of the policy language, this work enables the derivation of
security policies from specification to enforcement, in an automated way with
limited user intervention. I am not aware of any other work that achieves automated
policy derivation and deployment for usage control. Hence the contribution of
this thesis with respect to related work.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Research Description &amp; Results</title>
      <p>
        Use Case. I explain the major steps of this work through an example from
the social network domain: Alice wants to protect the pictures she posts in
her profile so that her friends who get access to them should not be able to
make local copies of those pictures. Alice can specify the policy “never copy
photos” using one of the policy templates described in step 3 below. Because
of the domain model and the mappings already provided by an administrator
(step 1), this policy is translated to many technical policies at various levels of
abstraction (step 2) and, sets of implementation-specific executable rules are
generated, deployed and enforced in the machines of Alice’s friends who access
her photos. If her friends update/change the systems installed on their machines,
the adaptive policy translation accommodates these changes (step 4).
Step 1: The Domain Meta-Model. As user actions and data in usage control
policies vary according to the domain context, I address the problem at the
domain-level. In the meta-model, I distinguish between data and user actions
(the platform-independent model), their corresponding technical representations
(the platform-specific model) and, the implementations of those technical
representations (the implementation-specific model). This is analogous to the MDA
viewpoints [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] with a minor difference in the naming of the different levels. The
meanings of all the model elements starting from action and data at the top level
are provided by mapping them to their next lower technical representations. A
detailed description of the meta-model, a high-level translation methodology and
the initial evaluation by example has been published in [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
      <p>
        Step 2: Policy Derivation. For derivation of policies, the domain meta-model of
step 1 is combined with the extended usage control model of [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. This is useful
in formalizing the semantics of the meta-model mappings. Additionally, it also
enables another type of action refinement: in terms of the states of the system as
states are already part of the extended usage control model. A few new operators
are also added to the policy language in order to model the semantics of actions
like “copy”. The combined model and the formalization of policy derivation that
includes action refinement and rule-based future to past translation of conditions
has been published in [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ].
      </p>
      <p>
        Step 3: Policy Derivation Methodology. In this step I address the methodological
aspect that consists of the definitions of various models and the specification,
derivation, instantiation and deployment of policies. The specification of policies
is simplified via templates defined by an administrator which are later configured
by the end user. The policy derivation is semi-automated. One of the reasons
that the complete process cannot be automated is that one specification-level
usage control policy can be enforced in different ways and a decision making
on enforcement strategy is required. For example, “never copy photos” can be
enforced by altogether inhibiting a copy action or replacing the original photo
by a predefined one or, allowing the copy with logs. I plan to partially automate
this decision making with templates where majority of cases are covered by the
predefined templates and only “exceptions” are handled by the administrators.
The complete policy derivation methodology is discussed in [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
Step 4: Adaptive Policy Derivation. To provide a realistic solution to the problem
at hand, we must get rid of the assumption of static domain structures. However,
if the systems evolve over time, we need a way to keep track of all the changes
that take place. Additionally, we must handle cases of pending obligations and
modification of action refinements in the domain. For this, I am working on a
methodological guidance to dynamically accommodate changes in the domain
structure. Intuitively, this includes considering all cases when the domain model
needs to be updated, provide interfaces for systems to register, publish their
technical artifacts and eventually de-register.
      </p>
      <p>Evaluation. The complete research work is planned in two phases: the
derivation of policies for static domains; and the extension of the framework to enable
the adaptive policy derivation. The results of each phase are planned to be
evaluated at the end of the phase by instantiating the translation of policies for
existing usage control enforcements for two use cases: one, a web-based social
network example with Firefox, X11 and OpenBSD; two, a semi-closed enterprise
setup with Thunderbird and Windows 7 OS. The results are to be evaluated
with respect to (i) requirements and (ii) related work answering if this work can
be classified as filling a gap or as improving an existing process or both. Also,
insights on generic semantics of actions are to be discussed.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Current Status &amp; Future Work</title>
      <p>By the time of submission of this paper, most of the work described in steps 1-3
has already been done for the translation of policies in static domains. This also
includes the investigation of typical specification-level policies in a web-based
social network and the design of templates to be used by end-users to specify
usage control policies. The respective publications at each step are mentioned
in §3. Currently, I am implementing static policy translation for a semi-closed
enterprise setup with Thunderbird and Windows 7. I am also working on the
adaptive semantics of actions and writing the dissertation. As next steps, I will
extend the implementations of policy translation for adaptive cases. I plan to
complete the work described in §3 by Autumn 2014.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>Through this research, I want to fill the gap between the end user’s
understanding of usage control policies and the actual enforcement of them in real
systems. For this, I provide a way to define the meanings of abstract constructs
in end-user policies. It is hard to establish a notion of correctness between the
meanings of low-level and high-level policies because the semantics of high-level
propositions is not explicitly defined but rather exists in the user’s mind. Hence
the correctness of the policy derivation is bound by that of the domain model
on which the derivation is based. The contribution comprises both the technical
and the methodological aspects of deriving implementation-level policies from
specification-level policies. It might be contended that the latter are too complex
for end users to understand and specify them at all. In that case, data protection
officers or any other trusted authority might specify these policies for particular
domains. Besides users, service providers would also benefit from this research
because their contracts/terms of use could be audited for compliance.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Pretschner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hilty</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Basin</surname>
          </string-name>
          .
          <article-title>Distributed usage control</article-title>
          .
          <source>Commun. ACM</source>
          ,
          <volume>49</volume>
          (
          <issue>9</issue>
          ):
          <fpage>39</fpage>
          -
          <lpage>44</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>J.</given-names>
            <surname>Park</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Sandhu</surname>
          </string-name>
          .
          <article-title>The UCON ABC usage control model</article-title>
          .
          <source>ACM Trans. on Information and System Security</source>
          ,
          <volume>7</volume>
          (
          <issue>1</issue>
          ):
          <fpage>128</fpage>
          -
          <lpage>174</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. R. Iannella (ed.).
          <source>Open Digital Rights Language v1.1</source>
          ,
          <year>2008</year>
          . http://odrl.net/1. 1/ODRL-11.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. Multimedia framework (MPEG-21) - Part 5:
          <string-name>
            <given-names>Rights</given-names>
            <surname>Expression Language</surname>
          </string-name>
          ,
          <year>2004</year>
          . ISO/IEC standard 21000-
          <fpage>5</fpage>
          :
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Parisi-Presicce</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>R.</given-names>
            <surname>Sandhu</surname>
          </string-name>
          .
          <article-title>A logical specification for usage control</article-title>
          .
          <source>In Proc. SACMAT</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Hilty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pretschner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Basin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schaefer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Walter</surname>
          </string-name>
          .
          <article-title>A policy language for distributed usage control</article-title>
          .
          <source>In Proc. ESORICS</source>
          , pages
          <fpage>531</fpage>
          -
          <lpage>546</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>N.</given-names>
            <surname>Damianou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dulay</surname>
          </string-name>
          , E. Lupu, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sloman</surname>
          </string-name>
          .
          <article-title>The Ponder Policy Specification Language</article-title>
          .
          <source>In Proc. POLICY</source>
          <year>1995</year>
          , pages
          <fpage>18</fpage>
          -
          <lpage>39</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>M.</given-names>
            <surname>Harvan</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Pretschner</surname>
          </string-name>
          .
          <article-title>State-based Usage Control Enforcement with Data Flow Tracking using System Call Interposition</article-title>
          .
          <source>In Proc. 3rd Intl. Conf. on Network and System Security</source>
          , pages
          <fpage>373</fpage>
          -
          <lpage>380</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>A.</given-names>
            <surname>Pretschner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Buechler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Harvan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schaefer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Walter</surname>
          </string-name>
          .
          <article-title>Usage control enforcement with data flow tracking for x11</article-title>
          .
          <source>In Proc. STM</source>
          <year>2009</year>
          , pages
          <fpage>124</fpage>
          -
          <lpage>137</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. L.
          <string-name>
            <surname>Desmet</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Joosen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Massacci</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Naliuka</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Philippaerts</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Piessens</surname>
            , and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Vanoverberghe</surname>
          </string-name>
          .
          <article-title>The S3MS</article-title>
          .
          <article-title>NET Run Time Monitor: Tool Demonstration</article-title>
          . ENTCS,
          <volume>253</volume>
          (
          <issue>5</issue>
          ):
          <fpage>153</fpage>
          -
          <lpage>159</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pretschner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Peschla</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Kuhn</surname>
          </string-name>
          .
          <article-title>Distributed data usage control for web applications: a social network implementation</article-title>
          .
          <source>CODASPY '11.</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>A.</given-names>
            <surname>Pretschner</surname>
          </string-name>
          , E. Lovat, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Buechler</surname>
          </string-name>
          .
          <article-title>Representation-independent data usage control</article-title>
          .
          <source>In Proc. 6th Intl. Workshop on Data Privacy Management</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Steven</surname>
            <given-names>Davy</given-names>
          </string-name>
          , Brendan Jennings,
          <string-name>
            <given-names>and John</given-names>
            <surname>Strassner</surname>
          </string-name>
          .
          <article-title>Policy conflict prevention via model-driven policy refinement</article-title>
          .
          <source>In Proc DSOM 2006</source>
          , pages
          <fpage>209</fpage>
          -
          <lpage>220</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. L.
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Chadwick</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Basden</surname>
            , and
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Cunningham</surname>
          </string-name>
          .
          <article-title>Automated decomposition of access control policies</article-title>
          .
          <source>In Proc. POLICY</source>
          <year>2005</year>
          , pages
          <fpage>6</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>J.</given-names>
            <surname>Young</surname>
          </string-name>
          .
          <article-title>Commitment analysis to operationalize software requirements from privacy policies</article-title>
          .
          <source>Requirements Engineering</source>
          ,
          <volume>16</volume>
          :
          <fpage>33</fpage>
          -
          <lpage>46</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>A.K. Bandara</surname>
            ,
            <given-names>E.C.</given-names>
          </string-name>
          <string-name>
            <surname>Lupu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Moffett</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Russo</surname>
          </string-name>
          .
          <article-title>A goal-based approach to policy refinement</article-title>
          .
          <source>In Proc. POLICY</source>
          <year>2004</year>
          , pages
          <fpage>229</fpage>
          -
          <lpage>239</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Y.B. Udupi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sahai</surname>
            , and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Singhal</surname>
          </string-name>
          .
          <article-title>A classification-based approach to policy refinement</article-title>
          .
          <source>In Proc. 10th IFIP/IEEE IM</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>J.</given-names>
            <surname>Beatty</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Hulgan</surname>
          </string-name>
          .
          <article-title>Experiences with a requirements object model</article-title>
          .
          <source>Lecture Notes in Comput. Sci.</source>
          , pages
          <fpage>104</fpage>
          -
          <lpage>117</lpage>
          . Springer Berlin / Heidelberg,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>A.</given-names>
            <surname>Guerrero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.A.</given-names>
            <surname>Villagra´</surname>
          </string-name>
          , J.E. Lo´pez de Vergara,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Sa´nchez-Macia´n, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Berrocal</surname>
          </string-name>
          .
          <article-title>Ontology-based policy refinement using swrl rules for management information definitions in owl</article-title>
          .
          <source>In DSOM</source>
          , pages
          <fpage>227</fpage>
          -
          <lpage>232</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>B.</given-names>
            <surname>Aziz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.E.</given-names>
            <surname>Arenas</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Wilson</surname>
          </string-name>
          .
          <article-title>Model-based refinement of security policies in collaborative virtual organisations</article-title>
          .
          <source>ESSoS</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>R.</given-names>
            <surname>Craven</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lobo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Lupu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Russo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sloman</surname>
          </string-name>
          .
          <article-title>Decomposition techniques for policy refinement</article-title>
          .
          <source>In Proc CNSM '10</source>
          , pages
          <fpage>72</fpage>
          -
          <lpage>79</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Joel</surname>
            <given-names>Reardon</given-names>
          </string-name>
          , David Basin,
          <string-name>
            <given-names>and Srdjan</given-names>
            <surname>Capkun</surname>
          </string-name>
          . Sok:
          <article-title>Secure data deletion</article-title>
          .
          <source>In Proceedings of the 2013 IEEE Symposium on Security and Privacy</source>
          ,
          <source>SP '13</source>
          , pages
          <fpage>301</fpage>
          -
          <lpage>315</lpage>
          , Washington, DC, USA,
          <year>2013</year>
          . IEEE Computer Society.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>R.</given-names>
            <surname>Neisse</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Doerr</surname>
          </string-name>
          .
          <article-title>Model-based specification and refinement of usage control policies</article-title>
          .
          <source>In Proc. PST'2013</source>
          , pages
          <fpage>169</fpage>
          -
          <lpage>176</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <given-names>J.</given-names>
            <surname>Miller</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Mukerji</surname>
          </string-name>
          .
          <source>Mda guide version 1.0.1. Technical Report omg/03-06-01</source>
          , Object Management Group (OMG),
          <year>June 2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <given-names>Prachi</given-names>
            <surname>Kumari</surname>
          </string-name>
          and
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Pretschner</surname>
          </string-name>
          .
          <article-title>Deriving implementation-level policies for usage control enforcement</article-title>
          .
          <source>CODASPY '12</source>
          , pages
          <fpage>83</fpage>
          -
          <lpage>94</lpage>
          . ACM,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <given-names>Prachi</given-names>
            <surname>Kumari</surname>
          </string-name>
          and
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Pretschner</surname>
          </string-name>
          .
          <article-title>Model-based usage control policy derivation</article-title>
          .
          <source>In Proc. ESSOS</source>
          <year>2013</year>
          , pages
          <fpage>58</fpage>
          -
          <lpage>74</lpage>
          .
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>