On the Hardness of Approximating the Min-Hack Problem

Ramkumar Chinchani (), Duc Ha (), Anusha Iyer (), Hung Q. Ngo () and Shambhu Upadhyaya ()
Additional contact information
Ramkumar Chinchani: State University of New York at Buffalo
Duc Ha: State University of New York at Buffalo
Anusha Iyer: State University of New York at Buffalo
Hung Q. Ngo: State University of New York at Buffalo
Shambhu Upadhyaya: State University of New York at Buffalo

Journal of Combinatorial Optimization, 2005, vol. 9, issue 3, No 5, 295-311

Abstract: Abstract We show several hardness results for the Minimum Hacking problem, which roughly can be described as the problem of finding the best way to compromise a target node given a few initial compromised nodes in a network. We give several reductions to show that Minimum Hacking is not approximable to within $$2^{(\log n)^{1-\delta}}$$ where δ = 1− $$\frac{1}{{log}{log}}$$ c n, for any c

Keywords: computer security; hardness of threat analysis (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-1413-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:9:y:2005:i:3:d:10.1007_s10878-005-1413-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-1413-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().