.png){kind=icon}
返回
Data survivability vs. security in information systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ress.2011.12.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A multiple objective problem formulation and solution methodology is presented to select optimal information and data storage configurations considering both data survivability and data security, as well as cost. This paper considers a situation where the information is divided into several separately stored blocks in order to mitigate the risk of unauthorized access or theft. The information can be used only if all of the blocks are accessed. To impede the information theft, the defender prefers to maximize the number of blocks. On the other hand the destruction of any block destroys the integrity of information and makes it impossible to use. To impede the information destruction, the defender prefers to maximize the number of parallel (reserve) copies of each block, regardless how many blocks in series there are. Given the set of available information storage resources, the defender must consider a multi-objective optimization problem to determine how many blocks and their copies to create, and how to distribute them among available resources in order to minimize information vulnerability, insecurity, and storage cost. Non-dominated solutions to this problem are determined using a multiple objective genetic algorithm (MOGA). This methodology is demonstrated with two general examples. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Data survivability
Data security
Protection
Redundancy
Attack
Optimization
期刊
R
IF:
11
论文数:
9.0K
被引数:
4.2W
机构
引用论文
Role of central cholinergic receptor sub-types in spatial working memory: a five-arm maze task in mice provides evidence for a functional role of nicotinic receptors in mediating trace access processes.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
查看更多内容