# A Cooperative Model for IS Security Risk Management in Distributed Environment

Authors: Nan Feng; Chundong Zheng
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Given the increasing cooperation between organizations, the flexible exchange of security information across the allied organizations is critical to effectively manage information systems (IS) security in a distributed environment. In this paper, we develop a cooperative model for IS security risk management in a distributed environment. In the proposed model, the exchange of security information among the interconnected IS under distributed environment is supported by Bayesian networks (BNs). In addition, for an organization’s IS, a BN is utilized to represent its security environment and dynamically predict its security risk level, by which the security manager can select an optimal action to safeguard the firm’s information resources. The actual case studied illustrates the cooperative model presented in this paper and how it can be exploited to manage the distributed IS security risk effectively.


---

## Body

## 1. Introduction

With the increasing of collaboration between organizations, the management of information systems (IS) security risk is distributed across the allied organizations and the cooperative activities between organizations are imperative [1–4]. Therefore, for more effectively assessing the security risk level of the IS in a distributed environment, it is critical to develop a system for the exchange of security information among the interconnected IS. However, how to achieve the flexible exchange of security information under distributed environment is a significant challenge in the process of modelling [5]. Unfortunately, few previous studies on IS security take the above issue into account.In this paper, a cooperative model for IS security risk management is proposed to estimate the risk level of each associated organization’s IS and support the decision making of security risk treatment in a distributed environment. In the model, the exchange of security information among the interconnected IS is achieved through Bayesian networks (BNs). Moreover, a BN is also exploited to model the security environment of an organization’s IS and predict its security risk level. However, it is difficult and critical task for a security manager to establish an appropriate BN, which is suitable for the environment of organization’s information systems [6–8]. To address this issue, in this paper, we develop an algorithm to support the BN initiation. Finally, based on the security risk level for an organization’s IS, the security manager selects an optimal action to protect its information resources.The remaining sections of this paper are organized as follows. We first review the relevant literature in Section2. Then we discuss the development of the cooperative model in detail in Sections 3 and 4. The proposed model is further demonstrated and validated in Section 5 via a case study. Finally, we summarize our contributions and point out further research directions.


## 2. Literature Review

There has been increased academic interest in the IS security risk management. From the technical literature, the security protocols [9], fire wall and intrusion detection techniques [10, 11], and authentication technologies [12, 13] have been examined. From an economics perspective, some researchers have investigated the investment on information systems security [14, 15], economics of vulnerability disclosure [16, 17], and the characteristics of internet security breaches that impact the market value of breached firms [18].In recent years, a new managerial perspective on IS security has emerged from the literature. This perspective focuses on the managerial processes that control the effective deployment of technical approaches and security resources to create a secure IS environment in an organization. From this perspective, Feng and Li [19] proposed an IS security risk evaluation model based on the improved evidence theory. For the handling of uncertain evidence found in IS security risk analysis, their model provided a novel approach to define the basic belief assignment of evidence theory. In addition, the model also presented a method of testing the evidential consistency, which is capable of resolving the conflicts from uncertain evidence. Then, in order to identify the causal relationships among security risk factors and analyze the complexity of vulnerability propagation, they also developed a security risk analysis model (SRAM) [20], in which the vulnerability propagation analysis is performed to determine the propagation paths with the highest IS security risk level. Yan [21] presented a conceptual model for IS security analysis, which can facilitate to identify potential security risks. Chen et al. [22] focus on controlling the risks in the form of the fault of information networks. They developed an approach to estimate the risk level on the vulnerability of information networks.Bayesian networks (BNs), also known as probabilistic belief networks, is a knowledge representation tool capable of representing dependence and independence relationships among random variables [23]. A BN, N
=
(
X
,
G
,
P
), consists of a directed acyclic graph G and a set of conditional probability distributions (beliefs) P for variables X. BN inference means computing the conditional probability for some variables given the evidence, which is defined as a collection of findings. This operation is also called probability updating or belief updating.In this paper, the developed BN is not only used to facilitate the dynamical prediction of the security risk level of an organization’s IS, but also exploited to model the IS security environment.


## 3. Model Architecture

In a distributed environment, the proposed model consists of many interconnected network information systems. We call these network information systems as “associated members.” Each associated member is installed with three kinds of components: monitor component, estimation component, and treatment component. Besides, the above three kinds of components, the registration component contains the information about each estimation component. It is required that all estimation components in the distributed environment must register with the registration component. The cooperative model architecture is demonstrated in Figure1.Figure 1
Model architecture.The interactions among the estimation component and the registration component are shown in Figure2. In the interactive process, as shown in Table 1, there are four kinds of sharing information: search request, search reply, registration message, and communication between estimation components.Table 1
Information exchange in the interactive process.
Exchange information
Description
Search request
It consists of the requester’s id, IP address, and the required input variables. The estimation component has a set of sharing variables. To find components capable of providing required input data, the estimation component sends a search request to the registration component.
Search reply
It consists of the requested variable name, the IP address, and status of the component publishing the variable. Based on receiving a search request, the registration component searches its database to determine which components can provide the requested variables.
Registration message
It consists of component id, IP address, list of published variables, and their possible states. Each estimation component registers with the registration component, which issues an acknowledgment message for entering the new component in its database.
Communication between estimation components
It consists of the request id, the sender’s id, and the probability distribution of the requested variable. Upon receiving the list of components capable of providing the required input from the registration component, the request component sends requests directly to these components. Then, the sender sends the probability distribution of the requested variable.Figure 2
Interactions among the components.


## 4. Bayesian Network Development

In this section, we present an algorithm based on ant colony optimization (shown in Algorithm1) to develop the Bayesian network (BN), which is able to model the security environment of an associated member under distributed environment.Algorithm 1:Bayesian network development algorithm.
Input: Set of all/candidate edges
Output: Bayesian network
(1)repeat
(2)
for  k
=
1 tom
do
(3)for  i
=
1 to n
do
P
a
(
x
i
)
=
ϕ;
(4)for  i
=
1 and j
=
1 to n  do
(5)if (i
≠
j) then
η
i
j
=
f
(
x
i
,
x
j
)
-
f
(
x
i
,
ϕ
);
(6)end
(7)repeat
(8)       Select two indexesi and j by using (4) and (5) and assign edge e
i
j to G
k;
(9)if(η
i
j
>
0) then
P
a
(
x
i
)
=
P
a
(
x
i
)
∪
{
x
j
};
(10)η
i
j
=
-
∞;
(11)for all  x
a
∈
A
n
c
e
s
t
o
r
s
(
x
j
)
∪
{
x
j
} and x
b
∈
D
e
s
c
e
n
d
a
n
t
s
(
x
i
)
∪
{
x
i
}  do
η
a
b
=
-
∞;
(12)for  k
=
1 to n  do
(13)
if(η
i
k
>
-
∞) then
η
i
j
=
f
(
x
i
,
P
a
(
x
i
)
∪
{
x
k
}
)
-
f
(
x
i
,
P
a
(
x
i
)
);
(14)end
(15)τ
i
j
=
(
1
-
ρ
)
·
τ
i
j
+
ρ
·
τ
0;
(16)
until  ∀
i
,
j
(
η
i
j
≤
0
or
η
i
j
=
-
∞
);
(17)end
(18)G
b
=
arg
⁡
max
⁡
k
:
1
…
m
f
(
G
k
:
D
);
(19)if  f
(
G
b
:
D
)
≥
f
(
G
*
:
D
)  then  G
*
=
G
b;
(20)  Update pheromone according to (2) using  f(G* : D);
(21)N
iter ++;
(22)until  N
iter
=
N
max
⁡;
(23)return  Bayesian network with structure
G
*The equations appearing in the algorithm are as follows.(1) Heuristic information:(1)
η
i
j
=
f
(
x
i
,
P
a
(
x
i
)
∪
{
x
j
}
)
-
f
(
x
i
,
P
a
(
x
i
)
)
.(2) Updating rule:(2)
τ
i
j
⟵
(
1
-
ρ
)
τ
i
j
+
ρ
Δ
τ
i
j
in which
(3)
Δ
τ
i
j
=
{
1
|
f
(
G
*
:
D
)
|
if
x
j
→
x
i
∈
G
*
τ
i
j
if
x
j
→
x
i
∉
G
*
,
in the arc x
j
→
x
i, τ
i
j is the pheromone’s degree, and ρ
(
0
<
ρ
≤
1
) is a variable which can control the pheromone value. Moreover, G
* is the BN structure suitable for the organization’s IS best.(3) Probabilistic transition:(4)
r
,
l
=
{
arg
max
⁡
i
,
j
∈
F
G
⁡
{
[
τ
i
j
]
α
[
η
i
j
]
β
}
if
q
≤
q
0
I
,
J
if
q
>
q
0
in which I and J are two nodes chosen randomly based on the following equation:
(5)
p
k
(
i
,
j
)
=
{
[
τ
i
j
]
α
[
η
i
j
]
β
∑
u
,
v
∈
F
G
[
τ
u
v
]
α
[
η
u
v
]
β
if
i
,
j
∈
F
G
0
otherwise
.


## 5. Case Study

In this section, the proposed model is applied to a distributed environment, which is composed of four associated members with interconnected IS: two suppliers (S1 and S2), a manufacturer (M1), and a downstream transporter (DT1).Based on the algorithm presented in Section4, we develop the BN for each associated member. Taking M1 and S1, for example, their information of BN nodes is given in Tables 2 and 3, and their BN structures are shown in Figure 3.Table 2
BN information of M1.
Node ID
Node name
State space
Parent nodes
Children nodes
M1_1
Network access control
{Effective; average; ineffective}
Φ
{M1_7}
M1_2
Network security audit
{Comprehensive; incomprehensive}
Φ
{M1_7}
M1_3
Change management
{Effective; average; ineffective}
Φ
{M1_9}
M1_4
Supplier threat level
{0; 1; 2; 3; 4; 5}
Φ
{M1_8}
M1_5
Transporter threat level
{0; 1; 2; 3; 4; 5}
Φ
{M1_8}
M1_6
Operational procedures and responsibilities
{Very standard; standard; non-standard}
Φ
{M1_9}
M1_7
Network security
{High; medium; low}
{M1_1, M1_2}
{M1_10}
M1_8
External systems security
{High; medium; low}
{M1_4, M1_5}
{M1_10}
M1_9
Operation security
{High; medium; low}
{M1_3, M1_6}
{M1_10}
M1_10
M1 threat level
{0; 1; 2; 3; 4; 5}
{M1_7, M1_8,  M1_9}
ΦTable 3
BN information of S1.
Node ID
Node name
State space
Parent nodes
Children nodes
S1_1
Communication secrecy
{High; medium; low}
Φ
{S1_6}
S1_2
Audit logging
{Secure; average; insecure}
Φ
{S1_6}
S1_3
Network access control
{Effective; average; ineffective}
Φ
{S1_5}
S1_4
Network security audit
{Comprehensive; incomprehensive}
Φ
{S1_5}
S1_5
Network security
{High; medium; low}
{S1_3, S1_4}
{S1_7}
S1_6
Communication security
{High; medium; low}
{S1_1, S1_2}
{S1_7}
S1_7
S1 threat level
{0; 1; 2; 3; 4; 5}
{S1_5, S1_6}
ΦFigure 3
BN structures of M1 and S1.The manager interface of our proposed model is shown in Figure4, in which the security manager can specify the BN for each associated organization.Figure 4
Security manager interface.Once the new evidence is obtained through the monitor components, the estimation component is able to make the BN modify its own belief (probability distribution on variable of risk level) in real time and exchange the update of beliefs of the security state with other associated members.


## 6. Conclusions

In a distributed environment, in order to effectively manage information systems (IS) security, a cooperative model based on Bayesian networks is presented and illustrated in this paper. We contribute to the IS security literature by supporting the exchange of security information among interconnected IS. Furthermore, for the modelling of IS security environment, an algorithm based on ant colony optimization facilitates to predict IS threat level more objectively. The model proposed in this paper has great potential for future extensions and refinements to provide more utility for the management of IS security.



---

*Source: 167497-2014-01-19.xml*