https://scholars.lib.ntu.edu.tw/handle/123456789/457518
標題: | Near optimal secret sharing for information leakage maximization | 作者: | YEONG-SUNG LIN Chu, K.-C Chen, P.-Y Chen, G.-W. |
公開日期: | 2010 | 卷: | 6098 LNAI | 期: | PART 3 | 起(迄)頁: | 189-198 | 來源出版物: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 摘要: | 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. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/457518 | DOI: | 10.1007/978-3-642-13033-5_20 | SDG/關鍵字: | Information security; Lagrangean Relaxation; Network Planning; Secret Sharing; Survivability; Algorithms; Crime; Industrial engineering; Intelligent systems; Mathematical operators; Mathematical programming; Resource allocation; Security of data |
顯示於: | 資訊管理學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。