<!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>Towards Visualising Security with Arguments</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Stefano Bistarelli</string-name>
          <email>bista@dmi.unipg.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabio Rossi</string-name>
          <email>rossi@dmi.unipg.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesco Santini</string-name>
          <email>francesco.santini@iit.cnr.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carlo Taticchi</string-name>
          <email>taticchi@dmi.unipg.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Matematica e Informatica, Universita di Perugia</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IIT-CNR</institution>
          ,
          <addr-line>Pisa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Abstract Argumentation has been proved as a simple yet powerful approach to manage con icts in reasoning with the purpose to nd subsets of \surviving" arguments. Our intent is to exploit such form of resolution to visually support the administration of security in complex systems. For instance, in case threat countermeasures are in con ict (also with assets) and only some of them can be selected.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        An Abstract Argumentation Framework (AAF ), or System, as introduced in a
seminal paper by Dung [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], is simply a pair hA; Ri consisting of a set A whose
elements are called arguments and of a binary relation R on A, called \attack"
relation. An abstract argument is not assumed to have any speci c structure
but, roughly speaking, an argument is anything that may attack or be attacked
by another argument. The sets of arguments (or extensions ) to be considered
are then de ned under di erent semantics, which are related to varying degrees
of scepticism or credulousness.
      </p>
      <p>In this work, our goal is to start developing a tool to visualise security threats
and related countermeasures as arguments, as if security was a continuous
dynamic discussion between the administrator and the surveilled system. Existing
automated tools to defend a system from such security threats are one potential
solution, but a completely automated approach could undervalue the strong
analytic capabilities of humans, particularly in problematic situations that require
vigilant human oversight.</p>
      <p>
        We measure the strength of subsets of arguments and single arguments in
accordance with Argumentation Theory. We print such strength degrees in di
erent colours with the purpose to immediately catch the attention of the Security
Administrator on what is going on in his system, and help him to take a decision
on the set of countermeasures to be considered.
In this section we brie y summarise the background information related to
classical Abstract Argumentation Frameworks (AAFs) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
? The author is supported by MIUR PRIN 2010XSEMLC \Security Horizons".
      </p>
      <p>De nition 1 (AAF). An Abstract Argumentation Framework (AAF) is a pair
F = hA; Ri of a set A of arguments and a binary relation R A A, called
the attack relation. 8a; b 2 A, aR b (or, a b) means that a attacks b. An AAF
may be represented by a directed graph whose nodes are arguments and edges
represent the attack relation. A set of arguments S A attacks an argument
a, i.e., S a, if a is attacked by an argument of S, i.e., 9b 2 S:b a. An
argument a 2 A is defended (in F ) by a set S A if for each b 2 A, such that
b a, also S b holds.</p>
      <p>
        Argumentation semantics [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] characterise a collective \acceptability" for
arguments. Respectively, adm, com, prf , and stb stand for admissible, complete,
preferred, and stable semantics.
      </p>
      <p>
        De nition 2 (Semantics [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]). Let F = hA; Ri be an AAF. A set S
con ict-free (in F), denoted S 2 cf (F ), i there are no a; b 2 S, such that a
or b a 2 R. For S 2 cf (F ), it holds that
A is
b
{ S 2 adm(F ), if each a 2 S is defended by S;
{ S 2 com(F ), if S 2 adm(F ) and for each a 2 A defended by S, a 2 S holds;
{ S 2 prf (F ), if S 2 adm(F ) and there is no T 2 adm(F ) with S T ;
{ S 2 stb(F ), if for each a 2 AnS, S a;
      </p>
      <p>We also recall that the requirements in Def. 2 de ne an inclusion
hierarchy on the corresponding extensions, from the most to the least stringent:
stb(F ) prf (F ) com(F ) adm(F ). Moreover, (F ) 6= ; always holds for
each considered semantics (except for the stable one).</p>
      <p>De nition 3 (Arguments acceptance-state). Given one of the semantics
in Def. 2 and a framework F , an argument a is i) sceptically accepted if
8S 2 (F ); a 2 S, ii) a is credulously accepted if 9S 2 (F ); a 2 S and a is not
sceptically accepted, and iii) a is rejected if @S 2 (F ); a 2 S.</p>
      <p>Consider F = hA; Ri in Fig. 1, with A = fa; b; c; d; eg and R = fa b; c b;
c d; d c; d e; e eg. In F we have adm(F ) = f;; fag; fcg; fdg; fa; cg; fa;
dgg, com(F ) = ffag; fa; cg; fa; dgg, prf (F ) = ffa; dg; fa; cgg, and stb(F ) =
ffa; dgg. Hence, argument a is sceptically accepted in com(F ), prf (F ) and
stb(F ), while it is only credulously accepted in adm(F ).
3</p>
    </sec>
    <sec id="sec-2">
      <title>A Visualisation Example</title>
      <p>Consider a small research and development company. This company cooperates
with other (often large) enterprises for the development of complex goods. Such
company possesses high-tech knowledge which has to be protected from
competitors. The company needs to e ciently use its resources with the purpose to
survive in a highly competitive market. In short, the company has the goal (i.e.,
asset) of ensuring the productivity of operations (QoS).</p>
      <p>In this small example, the security-system administrator has identi ed the
following threats and related security controls (in square brackets): hacker
penetration (HP) [host IDS (HI), network IDS (NI)] (where IDS stands for Intrusion
Detection System), employee abuse (EA) [monitoring functionality (MF), audit
procedures (AP)], and compromise of communication channel (CCC) [virtual
private network (VPN), encrypted line (EL)].</p>
      <p>We would like to emphasise that abstract arguments have no internal
structure, and are not \directly linked" to classical logic. For this reason, we can
consider multiple sources of information but and belief, such as case law,
common sense, and expert opinion. We can consider information coming from
multiple network-sensors, in the form of logs, warnings, and errors. Facts and beliefs
can be also taken from internal policy documents, and standard documents as
well. For instance the Standard of Good Practice for Information Security, is a
business-focused, practical and comprehensive guide to identifying and
managing information security risks in organizations and their supply chains. The 2011
Standard is aligned with the requirements for an Information Security
Management System (ISMS) set out in ISO/IEC 27000-series standards, and provides
wider and deeper coverage of ISOIEC 270023 control topics, as well as cloud
computing, information leakage, consumer devices and security governance.</p>
      <p>
        To work on our example we use SecArg 4 (Security with Arguments). SecArg
is based on ConArg [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ] (ARGumentation with CONstraints), which is an
Abstract Argumentation reasoning-tool using the Gecode library5, an e cient C++
environment where to develop constraint-based applications. The input (text)
le passed to SecArg contains the list of arguments partitioned into
countermeasures, threats, assets, and attacks between them: for instance,
countermeasure(HI), threat(HP), att(HI,HP) (hacker penetration is prevented by a host
IDS). SecArg visually represents the di erent nature of arguments with di erent
colours: green for countermeasures, red for threats, and yellow for assets.
      </p>
      <p>A more extended example is represented in Fig. 2. In such AAF we have that
executing a host IDS and a monitoring functionality on the same machine (i.e.,
HI&amp;MF) impacts on its QoS. Hence, we pose an attack between them, and we
also consider not having HI (NotHI) or MF (NotMF). Moreover, we have some
countermeasures in con ict, i.e., EL or VPN, and MF.</p>
      <p>We obtain three stable extensions (we use the stable semantics because it is
the most sceptical one, see Sec. 2): i) fAP, VPN, EL, HI, NI, NotMF, QoSg, ii)
fAP, VPN, EL, HI, NI, HI&amp;MFg, and iii) fAP, VPN, EL, NI, NotHI, NotMF,
QoSg. In this case, reasoning in terms of stable or preferred semantics is the
same, since they both returns the same three extensions. Reasoning on the
scep3 ISO, ISO, and I. E. C. Std. \ISO 27002: 2005.\ Information Technology-Security Techniques-Code
of Practice for Information Security Management. ISO (2005).
4 http://www.dmi.unipg.it/secarg
5 http://www.gecode.org
tical acceptance of arguments in such three extensions, we obtain that AP, VPN,
EL, NI are sceptically accepted (i.e., \always"). This means that, for the
attack/countermeasure scenario we have depicted, having audit procedures, a virtual
private network, an encrypted line, and a network IDS is always considered a
valid argument. Therefore, they correspond to a strong suggestion for the
security administrator. On the other hand, there are some other arguments that
are rejected (see Def. 3), that is they never appear in such extensions; for
instance EA, HP, MF, and CCC. All three threats are successfully \avoided", in
the sense that adopted security countermeasures always prevent all of them.
Moreover, also adopting the monitoring functionality countermeasure is not a
good idea given this scenario, since it is rejected as well. Finally, the
remaining arguments appear sometimes but not always in such three extensions (they
are credulously accepted, according to Def. 3): NotHI (in 1 extension), HI&amp;MF
(1), HI (2), NotMF (2), QoS (2). The number of times they appear is visually
highlighted in SecArg by lling arguments with di erent shades of grey, and
also returning the appearance ratio, e.g,. 66.6% for QoS and 33.3% for NotHI.
This can be interpreted as a strength-score for these arguments: for instance,
having an host IDS beats not having it (2 to 1): hence the administrator is
recommended to use it. For the sake of presentation, in Fig. 3 we use thick
continuous circles for sceptically accepted arguments, thin/thick dotted circles
for credulously accepted ones (respectively for lower/higher ratio of appearance,
e.g., QoS is thicker than NotHI), and light-grey circles for rejected arguments.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Related and Future Work</title>
      <p>Since the application of Argumentation to Cybersecurity-related issues is
relatively a new eld (or, at least, not deeply investigated), there is a few related
work to be mentioned. A bunch of works applying Argumentation-based con
ictresolution to the speci c case of rewall rules are [1{3]. In our approach, however,
we would like to provide a general reasoning-tool.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] the authors suggest the use of Argumentation to provide automated
support for Cybersecurity decisions. Three di erent tasks where Argumentation
can contribute are surveyed in the paper: rst, the establishment of a security
policy, drawing from a range of information on best practice and taking into
account likely attacks and the vulnerability of the system to those attacks.
Secondly, the process diagnosis to determine if an attack is underway after some
apparent anomaly in system operation is detected; the nal goal is to decide
what action, if any, should be taken to ensure system integrity. At last,
Argumentation can be used to recon gure a security policy in the aftermath of a
successful attack: this recon guration needs to ensure protection against future
similar-attacks, without creating new vulnerabilities.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] the authors propose how arguments can support the decision making
process: the aim is to help the system security administrator to react (or not) to
possible ongoing attacks. For instance, a decision can be taken either to disable
tra c through port 80 or not to disable it.
      </p>
      <p>In the next future we would like to extend SecArg from both the theoretical
and practical point of view by i) interactively changing the AAF with a new
node or attack and immediately see how much such modi cation impacts on the
strength of arguments; ii) selecting a subset S of arguments and get the minimal
amount of change to the AAF that transforms S into an extension satisfying a
given semantics (e.g., preferred).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Applebaum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levitt</surname>
            ,
            <given-names>K.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rowe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parsons</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Arguing about rewall policy</article-title>
          . In: Verheij,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Szeider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Woltran</surname>
          </string-name>
          , S. (eds.)
          <source>COMMA. Frontiers in Arti cial Intelligence and Applications</source>
          , vol.
          <volume>245</volume>
          , pp.
          <volume>91</volume>
          {
          <fpage>102</fpage>
          . IOS Press (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bandara</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kakas</surname>
            ,
            <given-names>A.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lupu</surname>
            ,
            <given-names>E.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Using argumentation logic for rewall policy speci cation and analysis</article-title>
          . In: State, R., van der Meer, S.,
          <string-name>
            <given-names>O</given-names>
            <surname>'Sullivan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Pfeifer</surname>
          </string-name>
          , T. (eds.)
          <source>DSOM. LNCS</source>
          , vol.
          <volume>4269</volume>
          , pp.
          <volume>185</volume>
          {
          <fpage>196</fpage>
          . Springer (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bandara</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kakas</surname>
            ,
            <given-names>A.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lupu</surname>
            ,
            <given-names>E.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Using argumentation logic for rewall con guration management</article-title>
          .
          <source>In: Integrated Network Management</source>
          . pp.
          <volume>180</volume>
          {
          <fpage>187</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bistarelli</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rossi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Benchmarking hard problems in random abstract AFs: The stable semantics</article-title>
          .
          <source>In: Computational Models of Argument - Proceedings of COMMA. FAIA</source>
          , vol.
          <volume>266</volume>
          , pp.
          <volume>153</volume>
          {
          <fpage>160</fpage>
          . IOS Press (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bistarelli</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rossi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>A rst comparison of abstract argumentation reasoning-tools</article-title>
          .
          <source>In: ECAI 2014 - 21st European Conference on Arti cial Intelligence. FAIA</source>
          , vol.
          <volume>263</volume>
          , pp.
          <volume>969</volume>
          {
          <fpage>970</fpage>
          . IOS Press (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Dung</surname>
            ,
            <given-names>P.M.</given-names>
          </string-name>
          :
          <article-title>On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games</article-title>
          .
          <source>Artif. Intell</source>
          .
          <volume>77</volume>
          (
          <issue>2</issue>
          ),
          <volume>321</volume>
          {
          <fpage>357</fpage>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Martinelli</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Debating cybersecurity or securing a debate? - (position paper)</article-title>
          .
          <source>In: Foundations and Practice of Security - 7th International Symposium</source>
          ,
          <string-name>
            <surname>FPS</surname>
          </string-name>
          <year>2014</year>
          .
          <article-title>LNCS</article-title>
          , vol.
          <volume>8930</volume>
          , pp.
          <volume>239</volume>
          {
          <fpage>246</fpage>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Rowe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levitt</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parsons</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sklar</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Applebaum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jalal</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Argumentation logic to assist in security administration</article-title>
          .
          <source>In: Proceedings of the 2012 Workshop on New Security Paradigms</source>
          . pp.
          <volume>43</volume>
          {
          <fpage>52</fpage>
          . NSPW '12,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>