Near optimal secret sharing for information leakage maximization

Frank Yeong Sung Lin, Kuo Chung Chu, Pei-yu Chen, Guan Wei Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages189-198
Number of pages10
Volume6098 LNAI
EditionPART 3
DOIs
StatePublished - 2010
Externally publishedYes
Event23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligence Systems, IEA/AIE 2010 - Cordoba, Spain
Duration: Jun 1 2010Jun 4 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume6098 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligence Systems, IEA/AIE 2010
CountrySpain
CityCordoba
Period6/1/106/4/10

Fingerprint

Secret Sharing
Mathematical programming
Leakage
Vertex of a graph
Lagrangean Relaxation
Mathematical Programming
Programming Model
Optimal Solution
Maximise
Attack
Heuristics
Mathematical Model
Scenarios
Operator

Keywords

  • Information Security
  • Lagrangean Relaxation
  • Network Planning
  • Optimization
  • Reliability
  • Resource Allocation
  • Secret Sharing
  • Survivability

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lin, F. Y. S., Chu, K. C., Chen, P., & Chen, G. W. (2010). Near optimal secret sharing for information leakage maximization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 3 ed., Vol. 6098 LNAI, pp. 189-198). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6098 LNAI, No. PART 3). https://doi.org/10.1007/978-3-642-13033-5_20

Near optimal secret sharing for information leakage maximization. / Lin, Frank Yeong Sung; Chu, Kuo Chung; Chen, Pei-yu; Chen, Guan Wei.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6098 LNAI PART 3. ed. 2010. p. 189-198 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6098 LNAI, No. PART 3).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, FYS, Chu, KC, Chen, P & Chen, GW 2010, Near optimal secret sharing for information leakage maximization. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 3 edn, vol. 6098 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 6098 LNAI, pp. 189-198, 23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligence Systems, IEA/AIE 2010, Cordoba, Spain, 6/1/10. https://doi.org/10.1007/978-3-642-13033-5_20
Lin FYS, Chu KC, Chen P, Chen GW. Near optimal secret sharing for information leakage maximization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 3 ed. Vol. 6098 LNAI. 2010. p. 189-198. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3). https://doi.org/10.1007/978-3-642-13033-5_20
Lin, Frank Yeong Sung ; Chu, Kuo Chung ; Chen, Pei-yu ; Chen, Guan Wei. / Near optimal secret sharing for information leakage maximization. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6098 LNAI PART 3. ed. 2010. pp. 189-198 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).
@inproceedings{92edacdef894414ca2482ddaa0146cd6,
title = "Near optimal secret sharing for information leakage maximization",
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.",
keywords = "Information Security, Lagrangean Relaxation, Network Planning, Optimization, Reliability, Resource Allocation, Secret Sharing, Survivability",
author = "Lin, {Frank Yeong Sung} and Chu, {Kuo Chung} and Pei-yu Chen and Chen, {Guan Wei}",
year = "2010",
doi = "10.1007/978-3-642-13033-5_20",
language = "English (US)",
isbn = "3642130321",
volume = "6098 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 3",
pages = "189--198",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 3",

}

TY - GEN

T1 - Near optimal secret sharing for information leakage maximization

AU - Lin, Frank Yeong Sung

AU - Chu, Kuo Chung

AU - Chen, Pei-yu

AU - Chen, Guan Wei

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Information Security

KW - Lagrangean Relaxation

KW - Network Planning

KW - Optimization

KW - Reliability

KW - Resource Allocation

KW - Secret Sharing

KW - Survivability

UR - http://www.scopus.com/inward/record.url?scp=79551536314&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79551536314&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13033-5_20

DO - 10.1007/978-3-642-13033-5_20

M3 - Conference contribution

AN - SCOPUS:79551536314

SN - 3642130321

SN - 9783642130328

VL - 6098 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 189

EP - 198

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -