Near optimal secret sharing for information leakage maximization
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Journal Volume
6098 LNAI
Journal Issue
PART 3
Pages
189-198
Date Issued
2010
Author(s)
Abstract
In this paper, we propose a mathematical programming model to describe an offense-defense scenario. In the offense problem, the objective of attackers is to compromise nodes in order to steal information. Therefore, the attackers try to recover secrets through compromising certain nodes and to maximize the information leakage as much as possible. During the attack actions, the attacker must allocate a limited budget to collect a large enough number of shares and decrypted keys through compromising certain nodes. Therefore, we advocate Lagrangean Relaxation algorithms and the proposed heuristics to find a near optimal solution. Through solutions from the perspective of the attacker, we then induce some efficient defense mechanisms for the network operators. © 2010 Springer-Verlag.
SDGs
Other Subjects
Information security; Lagrangean Relaxation; Network Planning; Secret Sharing; Survivability; Algorithms; Crime; Industrial engineering; Intelligent systems; Mathematical operators; Mathematical programming; Resource allocation; Security of data
Type
conference paper