{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T16:27:30Z","timestamp":1791476850194,"version":"4.3.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T00:00:00Z","timestamp":1521763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2018,10,30]]},"abstract":"<jats:p>The administrators of a mission critical network usually have to worry about non-traditional threats, e.g., how to live with known, but unpatchable vulnerabilities, and how to improve the network\u2019s resilience against potentially unknown vulnerabilities. To this end, network hardening is a well-known preventive security solution that aims to improve network security by taking proactive actions, namely, hardening options. However, most existing network hardening approaches rely on a single hardening option, such as disabling unnecessary services, which becomes less effective when it comes to dealing with unknown and unpatchable vulnerabilities. There lacks a heterogeneous approach that can combine different hardening options in an optimal way to deal with both unknown and unpatchable vulnerabilities. In this paper, we propose such an approach by unifying multiple hardening options, such as service diversification, firewall rule modification, adding, removing, and relocating network resources, and access control, all under the same model. We then apply security metrics designed for evaluating network resilience against unknown and unpatchable vulnerabilities, and consequently derive optimal solutions to maximize security under given cost constraints. Finally, we study the effectiveness of our solution against unpatchable vulnerabilities through simulations.<\/jats:p>","DOI":"10.3233\/jcs-171106","type":"journal-article","created":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T12:32:35Z","timestamp":1521808355000},"page":"761-789","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":8,"title":["Surviving unpatchable vulnerabilities through heterogeneous network hardening\u00a0options"],"prefix":"10.1177","volume":"26","author":[{"given":"Daniel","family":"Borbor","sequence":"first","affiliation":[{"name":"Concordia Institute for Information Systems Engineering, Concordia University, Quebec, Canada. E-mails:\u00a0,\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingyu","family":"Wang","sequence":"additional","affiliation":[{"name":"Concordia Institute for Information Systems Engineering, Concordia University, Quebec, Canada. E-mails:\u00a0,\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[{"name":"Center for Secure Information Systems, George Mason University, MD, USA. E-mail:\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anoop","family":"Singhal","sequence":"additional","affiliation":[{"name":"Computer Security Division, National Institute of Standards and Technology, VA, USA. E-mail:\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"ref001","doi-asserted-by":"crossref","unstructured":"M.\u00a0Albanese, S.\u00a0Jajodia and S.\u00a0Noel, Time-efficient and cost-effective network hardening using attack graphs, in: 2012 42nd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), IEEE, 2012, pp.\u00a01\u201312.","DOI":"10.1109\/DSN.2012.6263942"},{"key":"ref002","doi-asserted-by":"crossref","unstructured":"P.\u00a0Ammann, D.\u00a0Wijesekera and S.\u00a0Kaushik, Scalable, graph-based network vulnerability analysis, in: Proceedings of the 9th ACM Conference on Computer and Communications Security, ACM, 2002, pp.\u00a0217\u2013224.","DOI":"10.1145\/586110.586140"},{"key":"ref003","unstructured":"APACHE, Apache MINA project, October, 2016, https:\/\/mina.apache.org\/mina-project\/."},{"key":"ref004","unstructured":"A.\u00a0Avizienis and L.\u00a0Chen, On the implementation of N-version programming for software fault tolerance during execution, in: Proc. IEEE COMPSAC, 1977, pp.\u00a0149\u2013155."},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1016\/j.jher.2008.10.001"},{"key":"ref006","unstructured":"K.\u00a0Bakshi, CISCO cloud computing \u2013 Data center strategy, architecture, and solutions, CISCO White paper, 2009, retrieved October 13, 2010."},{"key":"ref007","unstructured":"M.\u00a0Bani, Duck and cover or how AtomBombing is really unnecessarily alarmism, Microsoft Technet Blog, November, 2016, https:\/\/blogs.technet.microsoft.com\/motiba\/2016\/11\/11\/duck-and-cover-or-how-atombombing-is-really-unnecessarily-alarmism\/."},{"key":"ref008","unstructured":"J.\u00a0Barr, Building three-tier architectures with security groups, Amazon Web Services, June, 2010, https:\/\/aws.amazon.com\/blogs\/aws\/building-three-tier-architectures-with-security-groups\/."},{"key":"ref009","doi-asserted-by":"crossref","unstructured":"D.\u00a0Borbor, L.\u00a0Wang, S.\u00a0Jajodia and A.\u00a0Singhal, Diversifying network services under cost constraints for better resilience against unknown attacks, in: IFIP Annual Conference on Data and Applications Security and Privacy, Springer, 2016, pp.\u00a0295\u2013312.","DOI":"10.1007\/978-3-319-41483-6_21"},{"key":"ref010","doi-asserted-by":"crossref","unstructured":"D.\u00a0Borbor, L.\u00a0Wang, S.\u00a0Jajodia and A.\u00a0Singhal, Securing networks against unpatchable and unknown vulnerabilities using heterogeneous hardening options, in: IFIP Annual Conference on Data and Applications Security and Privacy, Springer, 2017, pp.\u00a0509\u2013528.","DOI":"10.1007\/978-3-319-61176-1_28"},{"key":"ref011","unstructured":"B.\u00a0Cox, D.\u00a0Evans, A.\u00a0Filipi, J.\u00a0Rowanhill, W.\u00a0Hu, J.\u00a0Davidson, J.\u00a0Knight, A.\u00a0Nguyen-Tuong and J.\u00a0Hiser, N-variant systems: A secretless framework for security through diversity, in: USENIX Security, 2006, pp.\u00a0105\u2013120."},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"ref013","unstructured":"Defense use case, Analysis of the cyber attack on the Ukrainian power grid, 2016."},{"key":"ref014","doi-asserted-by":"crossref","unstructured":"R.\u00a0Dewri, N.\u00a0Poolsappasit, I.\u00a0Ray and D.\u00a0Whitley, Optimal security hardening using multi-objective optimization on attack tree models of networks, in: Proceedings of the 14th ACM Conference on Computer and Communications Security, ACM, 2007, pp.\u00a0204\u2013213.","DOI":"10.1145\/1315245.1315272"},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0160-y"},{"key":"ref016","unstructured":"N.\u00a0Falliere, L.O.\u00a0Murchu and E.\u00a0Chien, W32.Stuxnet Dossier, White paper, Symantec Corp., Security Response, 2011."},{"key":"ref017","doi-asserted-by":"crossref","unstructured":"P.\u00a0Festa, A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems, in: 2014 16th International Conference on Transparent Optical Networks (ICTON), IEEE, 2014, pp.\u00a01\u201320.","DOI":"10.1109\/ICTON.2014.6876285"},{"key":"ref018","unstructured":"T.\u00a0Fifield, D.\u00a0Fleming, A.\u00a0Gentle, L.\u00a0Hochstein, J.\u00a0Proulx, E.\u00a0Toews and J.\u00a0Topjian, OpenStack Operations Guide, O\u2019Reilly Media, Inc., 2014."},{"key":"ref019","doi-asserted-by":"crossref","unstructured":"M.\u00a0Frigault, L.\u00a0Wang, A.\u00a0Singhal and S.\u00a0Jajodia, Measuring network security using dynamic Bayesian network, in: Proceedings of the 4th ACM Workshop on Quality of Protection, ACM, 2008, pp.\u00a023\u201330. doi:10.1145\/1456362.1456368.","DOI":"10.1145\/1456362.1456368"},{"key":"ref020","doi-asserted-by":"crossref","unstructured":"D.\u00a0Gao, M.K.\u00a0Reiter and D.\u00a0Song, Behavioral distance measurement using hidden Markov models, in: Recent Advances in Intrusion Detection, Springer, 2006, pp.\u00a019\u201340. doi:10.1007\/11856214_2.","DOI":"10.1007\/11856214_2"},{"key":"ref021","doi-asserted-by":"crossref","unstructured":"M.\u00a0Garcia, A.\u00a0Bessani, I.\u00a0Gashi, N.\u00a0Neves and R.\u00a0Obelheiro, OS diversity for intrusion tolerance: Myth or reality? in: 2011 IEEE\/IFIP 41st International Conference on Dependable Systems & Networks (DSN), IEEE, 2011, pp.\u00a0383\u2013394. doi:10.1109\/DSN.2011.5958251.","DOI":"10.1109\/DSN.2011.5958251"},{"key":"ref022","unstructured":"D.E.\u00a0Golberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989."},{"key":"ref023","doi-asserted-by":"crossref","unstructured":"A.\u00a0Gunasekaran, Organizational Advancements Through Enterprise Information Systems: Emerging Applications and Developments: Emerging Applications and Developments, IGI Global, 2009.","DOI":"10.4018\/978-1-60566-968-7"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2004.06.004"},{"key":"ref025","unstructured":"S.\u00a0Jajodia, S.\u00a0Noel and B.\u00a0O\u2019Berry, Topological analysis of network attack vulnerability, in: Managing Cyber Threats: Issues, Approaches and Challenges, V.\u00a0Kumar, J.\u00a0Srivastava and A.\u00a0Lazarevic, eds, Kluwer Academic Publisher, 2003."},{"key":"ref026","doi-asserted-by":"crossref","unstructured":"J.\u00a0McHugh, Quality of protection: Measuring the unmeasurable? in: Proceedings of the 2nd ACM Workshop on Quality of Protection, ACM, 2006, pp.\u00a01\u20132.","DOI":"10.1145\/1179494.1179495"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.145"},{"key":"ref028","unstructured":"L.\u00a0Mieritz and B.\u00a0Kirwin, Defining Gartner total cost of ownership, 2005."},{"key":"ref029","unstructured":"NASDAQ, Amazon.com, Inc. revenue and earnings per share (EPS), June, 2017, http:\/\/www.nasdaq.com\/symbol\/amzn\/revenue-eps\/."},{"key":"ref030","unstructured":"National Institute of Standards and Technology, NIST Special Publication 500-307: Cloud computing service metrics description, 2015, https:\/\/www.nist.gov\/sites\/default\/files\/documents\/itl\/cloud\/RATAX-CloudServiceMetricsDescription-DRAFT-20141111.pdf, accessed September, 2017."},{"key":"ref031","unstructured":"X.\u00a0Ou, S.\u00a0Govindavajhala and A.W.\u00a0Appel, MulVAL: A logic-based network security analyzer, in: USENIX Security, 2005."},{"key":"ref032","unstructured":"D.\u00a0Pauli, Easy remote exploit drops for unpatchable power plant controller, The Register, May, 2016, http:\/\/www.theregister.co.uk\/2016\/05\/31\/esc_8832_homeland_security_vuln\/."},{"key":"ref033","unstructured":"Ponemon Institute LLC, Cost of data center outages, Data Center Performance Benchmark Series, January, 2016, http:\/\/www.ponemon.org\/blog\/2016-cost-of-data-center-outages\/."},{"key":"ref034","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2011.34"},{"key":"ref035","doi-asserted-by":"crossref","unstructured":"I.\u00a0Ray and N.\u00a0Poolsapassit, Using attack trees to identify malicious attacks from authorized insiders, in: ESORICS 2005, Springer, 2005, pp.\u00a0231\u2013246. doi:10.1007\/11555827_14.","DOI":"10.1007\/11555827_14"},{"key":"ref036","doi-asserted-by":"crossref","unstructured":"O.\u00a0Sheyner, J.\u00a0Haines, S.\u00a0Jha, R.\u00a0Lippmann and J.M.\u00a0Wing, Automated generation and analysis of attack graphs, in: 2002 IEEE Symposium on Security and Privacy, 2002. Proceedings, IEEE, 2002, pp.\u00a0273\u2013284. doi:10.1109\/SECPRI.2002.1004377.","DOI":"10.1109\/SECPRI.2002.1004377"},{"key":"ref037","unstructured":"Statista, Number of Amazon.com employees from 2007 to 2016, June, 2017, https:\/\/www.statista.com\/statistics\/234488\/number-of-amazon-employees\/."},{"key":"ref038","doi-asserted-by":"crossref","unstructured":"L.\u00a0Wang, M.\u00a0Albanese and S.\u00a0Jajodia, Network Hardening: An Automated Approach to Improving Network Security, Springer, 2014. ISBN 9783319046112. doi:10.1007\/978-3-319-04612-9.","DOI":"10.1007\/978-3-319-04612-9"},{"key":"ref039","doi-asserted-by":"crossref","unstructured":"L.\u00a0Wang, T.\u00a0Islam, T.\u00a0Long, A.\u00a0Singhal and S.\u00a0Jajodia, An attack graph-based probabilistic security metric, in: IFIP Annual Conference on Data and Applications Security and Privacy, Springer, 2008, pp.\u00a0283\u2013296.","DOI":"10.1007\/978-3-540-70567-3_22"},{"key":"ref040","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2013.24"},{"key":"ref041","doi-asserted-by":"crossref","unstructured":"L.\u00a0Wang, S.\u00a0Jajodia, A.\u00a0Singhal and S.\u00a0Noel, k-zero day safety: Measuring the security risk of networks against unknown attacks, in: ESORICS 2010, Springer, 2010, pp.\u00a0573\u2013587. doi:10.1007\/978-3-642-15497-3_35.","DOI":"10.1007\/978-3-642-15497-3_35"},{"key":"ref042","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2006.06.018"},{"key":"ref043","doi-asserted-by":"crossref","unstructured":"L.\u00a0Wang, A.\u00a0Singhal and S.\u00a0Jajodia, Measuring the overall security of network configurations using attack graphs, in: Data and Applications Security XXI, Springer, 2007, pp.\u00a098\u2013112. doi:10.1007\/978-3-540-73538-0_9.","DOI":"10.1007\/978-3-540-73538-0_9"},{"key":"ref044","doi-asserted-by":"crossref","unstructured":"L.\u00a0Wang, M.\u00a0Zhang, S.\u00a0Jajodia, A.\u00a0Singhal and M.\u00a0Albanese, Modeling network diversity for evaluating the robustness of networks against zero-day attacks, in: ESORICS 2014, Springer, 2014, pp.\u00a0494\u2013511.","DOI":"10.1007\/978-3-319-11212-1_28"},{"key":"ref045","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2012.09.013"},{"key":"ref046","doi-asserted-by":"crossref","unstructured":"B.\u00a0Yigit, G.\u00a0Gur and F.\u00a0Alagoz, Cost-aware network hardening with limited budget using compact attack graphs, in: 2014 IEEE Military Communications Conference (MILCOM), IEEE, 2014, pp.\u00a0152\u2013157. doi:10.1109\/MILCOM.2014.31.","DOI":"10.1109\/MILCOM.2014.31"},{"key":"ref047","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2516916"}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-171106","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-171106","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-171106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:45:14Z","timestamp":1777495514000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-171106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,23]]},"references-count":47,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,10,30]]}},"alternative-id":["10.3233\/JCS-171106"],"URL":"https:\/\/doi.org\/10.3233\/jcs-171106","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,23]]}}}