{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T10:15:56Z","timestamp":1779099356187,"version":"3.51.4"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10207-022-00586-7","type":"journal-article","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:03:07Z","timestamp":1648634587000},"page":"813-832","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A multi-objective cost\u2013benefit optimization algorithm for network hardening"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9983-8513","authenticated-orcid":false,"given":"Kengo","family":"Zenitani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,30]]},"reference":[{"key":"586_CR1","doi-asserted-by":"publisher","unstructured":"Albanese, M., Jajodia, S., Noel, S.: Time-efficient and cost-effective network hardening using attack graphs. In: IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN 2012), pp. 1\u201312. IEEE (2012). ISBN 978-1-4673-1625-5. https:\/\/doi.org\/10.1109\/DSN.2012.6263942. URL http:\/\/ieeexplore.ieee.org\/document\/6263942\/","DOI":"10.1109\/DSN.2012.6263942"},{"issue":"9","key":"586_CR2","doi-asserted-by":"publisher","first-page":"3903","DOI":"10.1016\/j.asoc.2013.04.015","volume":"13","author":"H Ali","year":"2013","unstructured":"Ali, H., Khan, F.A.: Attributed multi-objective comprehensive learning particle swarm optimization for optimal security of networks. Appl. Soft Comput. 13(9), 3903\u20133921 (2013). https:\/\/doi.org\/10.1016\/j.asoc.2013.04.015","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"586_CR3","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TDSC.2015.2411264","volume":"13","author":"HMJ Almohri","year":"2016","unstructured":"Almohri, H.M.J., Watson, L.T., Yao, D., Ou, X.: Security optimization of dynamic networks with probabilistic graph modeling and linear programming. IEEE Trans. Dependable Secure Comput. 13(4), 474\u2013487 (2016). https:\/\/doi.org\/10.1109\/TDSC.2015.2411264","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"586_CR4","doi-asserted-by":"publisher","unstructured":"Ammann, P., Wijesekera, D., Kaushik, S.: Scalable, graph-based network vulnerability analysis. In: Proceedings of the 9th ACM Conference on Computer and Communications Security - CCS\u201902, p. 217. ACM Press, New York, USA (2002). ISBN 1581136129. https:\/\/doi.org\/10.1145\/586110.586140. http:\/\/portal.acm.org\/citation.cfm?doid=586110.586140","DOI":"10.1145\/586110.586140"},{"key":"586_CR5","unstructured":"Bacic, E., Froh, M., Henderson, G.: MulVAL Extensions For Dynamic Asset Protection. Defence R&D Canada (2006)"},{"key":"586_CR6","doi-asserted-by":"publisher","unstructured":"Bhuiyan, T.H., Nandi, A.K., Medal, H., Halappanavar, M.: Minimizing expected maximum risk from cyber-Attacks with probabilistic attack success. In: 2016 IEEE Symposium on Technologies for Homeland Security, HST 2016, pp. 1\u20136 (2016). https:\/\/doi.org\/10.1109\/THS.2016.7568892","DOI":"10.1109\/THS.2016.7568892"},{"issue":"1","key":"586_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/69.43410","volume":"1","author":"S Ceri","year":"1989","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: What you always wanted to know about Datalog (and never dared to ask). IEEE Trans. Knowl. Data Eng. 1(1), 146\u2013166 (1989). https:\/\/doi.org\/10.1109\/69.43410","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"586_CR8","doi-asserted-by":"publisher","unstructured":"Cheng, P., Wang, L., Jajodia, S., Singhal, A.: Aggregating CVSS base scores for semantics-rich network security metrics. In: 2012 IEEE 31st Symposium on Reliable Distributed Systems, pp. 31\u201340. IEEE (2012). ISBN 978-1-4673-2397-0. https:\/\/doi.org\/10.1109\/SRDS.2012.4. URL http:\/\/ieeexplore.ieee.org\/document\/6424837\/","DOI":"10.1109\/SRDS.2012.4"},{"key":"586_CR9","first-page":"141","volume":"9","author":"O Cordon","year":"2002","unstructured":"Cordon, O., Herrera, F., St\u00fctzle, T.: A review on the ant colony optimization metaheuristic: basis, models and new trends. Mathw. Soft Comput. 9, 141\u2013175 (2002)","journal-title":"Mathw. Soft Comput."},{"key":"586_CR10","doi-asserted-by":"publisher","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 337\u2013340. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24. URL http:\/\/link.springer.com\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"issue":"2","key":"586_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"586_CR12","doi-asserted-by":"publisher","unstructured":"Dewri, R., Poolsappasit, N., Ray, I., Whitley, D.: 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 - CCS \u201907, p. 20. ACM Press, New York, USA (2007). ISBN 9781595937032. https:\/\/doi.org\/10.1145\/1315245.1315272. URL http:\/\/portal.acm.org\/citation.cfm?doid=1315245.1315272","DOI":"10.1145\/1315245.1315272"},{"issue":"3","key":"586_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10207-012-0160-y","volume":"11","author":"R Dewri","year":"2012","unstructured":"Dewri, R., Ray, I., Poolsappasit, N., Whitley, D.: Optimal security hardening on attack tree models of networks: a cost-benefit analysis. Int. J. Inf. Secur. 11(3), 167\u2013188 (2012). https:\/\/doi.org\/10.1007\/s10207-012-0160-y","journal-title":"Int. J. Inf. Secur."},{"issue":"1","key":"586_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 26(1), 29\u201341 (1996). https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybernetics)"},{"key":"586_CR15","doi-asserted-by":"publisher","unstructured":"Durkota, K., Lis\u00fd, V., Bo\u0161ansk\u00fd, B., Kiekintveld, C.: Approximate solutions for attack graph games with imperfect information. In: Lecture Notes in Computer Science (including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9406, pp. 228\u2013249. (2015). ISSN 16113349. https:\/\/doi.org\/10.1007\/978-3-319-25594-1_13","DOI":"10.1007\/978-3-319-25594-1_13"},{"issue":"Ijcai","key":"586_CR16","first-page":"526","volume":"2015","author":"K Durkota","year":"2015","unstructured":"Durkota, K., Lisy, V., Bosansky, B., Kiekintveld, C.: Optimal network security hardening using attack graph games. IJCAI Int. Jt. Conf. Artif. Intell. 2015(Ijcai), 526\u2013532 (2015)","journal-title":"IJCAI Int. Jt. Conf. Artif. Intell."},{"issue":"5","key":"586_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MIS.2016.74.ISSN15411672","volume":"31","author":"K Durkota","year":"2016","unstructured":"Durkota, K., Lisy, V., Kiekintveld, C., Bosansky, B., Pechoucek, M.: Case studies of network defense with attack graph games. IEEE Intell. Systems 31(5), 24\u201330 (2016). https:\/\/doi.org\/10.1109\/MIS.2016.74.ISSN15411672","journal-title":"IEEE Intell. Systems"},{"key":"586_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761984","author":"SY Enoch","year":"2019","unstructured":"Enoch, S.Y., Hong, J.B., Ge, M., Khan, K.M., Kim, D.S.: Multi-objective security hardening optimisation for dynamic networks. IEEE Int. Conf. Commun. (2019). https:\/\/doi.org\/10.1109\/ICC.2019.8761984","journal-title":"IEEE Int. Conf. Commun."},{"issue":"3\u20134","key":"586_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: Strips: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\u20134), 189\u2013208 (1971). https:\/\/doi.org\/10.1016\/0004-3702(71)90010-5","journal-title":"Artif. Intell."},{"key":"586_CR20","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/CSF49147.2020.00035","volume":"2020","author":"B Fila","year":"2020","unstructured":"Fila, B., Widel, W.: Exploiting attack-defense trees to find an optimal set of countermeasures. Proc. IEEE Comput. Secur. Found. Symp. 2020, 395\u2013410 (2020). https:\/\/doi.org\/10.1109\/CSF49147.2020.00035","journal-title":"Proc. IEEE Comput. Secur. Found. Symp."},{"key":"586_CR21","unstructured":"FIRST: Common Vulnerability Scoring System version 3.1: Specification Document Revision 1. pp. 1\u201328. (2019)"},{"issue":"Jul","key":"586_CR22","first-page":"2171","volume":"13","author":"F-A Fortin","year":"2012","unstructured":"Fortin, F.-A., De, R., Fran\u00e7ois-Michel, G., Marc-Andr\u00e9, P., Marc, G.: DEAP: evolutionary algorithms made easy. J. Mach. Learn. Res. 13(Jul), 2171\u20132175 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"586_CR23","unstructured":"Froh, M., Henderson, G.: MulVAL Extensions II Defence R&D Canada-Ottawa. (2009)"},{"issue":"3","key":"586_CR24","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1590\/0101-7438.2014.034.03.0585","volume":"34","author":"EH Fukuda","year":"2014","unstructured":"Fukuda, E.H., Drummond, L.M.G.: A survey on multiobjective descent methods. Pesqui. Oper. 34(3), 585\u2013620 (2014). https:\/\/doi.org\/10.1590\/0101-7438.2014.034.03.0585","journal-title":"Pesqui. Oper."},{"key":"586_CR25","doi-asserted-by":"publisher","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Handbook of Combinatorial Optimization, pp. 2093\u20132229. Springer US, Boston, MA (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_33. URL http:\/\/spot.colorado.edu\/~glover. http:\/\/link.springer.com\/10.1007\/978-1-4613-0303-9_33","DOI":"10.1007\/978-1-4613-0303-9_33"},{"issue":"2","key":"586_CR26","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968). https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"586_CR27","unstructured":"Homer, J., Ou, X., McQueen, M.A.: From attack graphs to automated configuration management-an iterative approach. Technical report (2008). URL https:\/\/people.cs.ksu.edu\/~xou\/publications\/tr_ou_0108.pdf"},{"key":"586_CR28","unstructured":"Homer, J., Ou, X., Schmidt, D.: A sound and practical approach to quantifying security risk in enterprise networks. Kansas State University Technical Report, pp. 1\u201315. (2009)"},{"issue":"2","key":"586_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/int.20128","volume":"21","author":"VL Huang","year":"2006","unstructured":"Huang, V.L., Suganthan, P.N., Liang, J.J.: Comprehensive learning particle swarm optimizer for solving multiobjective optimization problems. Int. J. Intell. Syst. 21(2), 209\u2013226 (2006). https:\/\/doi.org\/10.1002\/int.20128","journal-title":"Int. J. Intell. Syst."},{"key":"586_CR30","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-1-4419-0140-8_7","volume-title":"Cyber Situational Awareness","author":"S Jajodia","year":"2010","unstructured":"Jajodia, S., Noel, S.: Topological vulnerability analysis. In: Cyber Situational Awareness, pp. 139\u2013154. Elsevier, Amsterdam (2010). https:\/\/doi.org\/10.1007\/978-1-4419-0140-8_7"},{"issue":"3","key":"586_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3137571","volume":"18","author":"S Jajodia","year":"2018","unstructured":"Jajodia, S., Park, N., Serra, E., Subrahmanian, V.S.: SHARE. ACM Trans. Internet Technol. 18(3), 1\u201341 (2018). https:\/\/doi.org\/10.1145\/3137571","journal-title":"ACM Trans. Internet Technol."},{"key":"586_CR32","doi-asserted-by":"publisher","unstructured":"Jha, S., Sheyner, O., Wing, J.: Two formal analysis of attack graphs. In: Proceedings - Computer Security Foundations Workshop, 15th IEEE, pp. 49\u201363. (2002). ISBN 0-7695-1689-0. https:\/\/doi.org\/10.3724\/SP.J.1001.2010.03584. URL http:\/\/pub.chinasciencejournal.com\/article\/getArticleRedirect.action?doiCode=10.3724\/SP.J.1001.2010.03584","DOI":"10.3724\/SP.J.1001.2010.03584"},{"issue":"3","key":"586_CR33","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.ejor.2019.04.035","volume":"278","author":"MHR Khouzani","year":"2019","unstructured":"Khouzani, M.H.R., Liu, Z., Malacaria, P.: Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs. Eur. J. Oper. Res. 278(3), 894\u2013903 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.04.035","journal-title":"Eur. J. Oper. Res."},{"key":"586_CR34","doi-asserted-by":"publisher","unstructured":"Kordy, B., Wide\u0142, W.: How well can i secure my system?. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence And Lecture Notes in Bioinformatics), 10510 LNCS, pp. 332\u2013347 (2017). https:\/\/doi.org\/10.1007\/978-3-319-66845-1_22","DOI":"10.1007\/978-3-319-66845-1_22"},{"key":"586_CR35","doi-asserted-by":"publisher","unstructured":"Kordy, B., Wide\u0142, W.: On quantitative analysis of attack defense trees with repeated labels. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10804 LNCS:325\u2013346. (2018). ISSN 16113349. https:\/\/doi.org\/10.1007\/978-3-319-89722-6_14","DOI":"10.1007\/978-3-319-89722-6_14"},{"issue":"1","key":"586_CR36","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/logcom\/exs029","volume":"24","author":"B Kordy","year":"2014","unstructured":"Kordy, B., Mauw, S., Radomirovi\u0107, S., Schweitzer, P.: Attack-defense trees. J. Log. Comput. 24(1), 55\u201387 (2014). https:\/\/doi.org\/10.1093\/logcom\/exs029","journal-title":"J. Log. Comput."},{"key":"586_CR37","unstructured":"Joshua, L., Yevgeniy, V.: Optimal interdiction of attack plans. In: 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013, vol. 1, pp. 199\u2013206. (2013)"},{"key":"586_CR38","unstructured":"Li, X.Y.: Optimization algorithms for the minimum-cost satisfiability problem. PhD thesis, North Carolina State University, Raleigh, North Carolina, (2004). URL http:\/\/www.lib.ncsu.edu\/resolver\/1840.16\/4594"},{"key":"586_CR39","doi-asserted-by":"publisher","unstructured":"Miehling, E., Rasouli, M., Teneketzis, D.: Optimal defense policies for partially observable spreading processes on Bayesian attack graphs. In: MTD 2015 - Proceedings of the 2nd ACM Workshop on Moving Target Defense, Co-located with: CCS 2015, pp. 67\u201376. (2015). https:\/\/doi.org\/10.1145\/280475.28084828","DOI":"10.1145\/280475.28084828"},{"issue":"10","key":"586_CR40","doi-asserted-by":"publisher","first-page":"2490","DOI":"10.1109\/TIFS.2018.2819967","volume":"13","author":"E Miehling","year":"2018","unstructured":"Miehling, E., Rasouli, M., Teneketzis, D.: A POMDP approach to the dynamic defense of large-scale cyber networks. IEEE Trans. Inf. Forensics Secur. 13(10), 2490\u20132505 (2018). https:\/\/doi.org\/10.1109\/TIFS.2018.2819967","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"586_CR41","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2016.05.005","volume":"75","author":"AK Nandi","year":"2016","unstructured":"Nandi, A.K., Medal, H.R., Vadlamani, S.: Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model. Comput. Oper. Res. 75, 118\u2013131 (2016). https:\/\/doi.org\/10.1016\/j.cor.2016.05.005","journal-title":"Comput. Oper. Res."},{"key":"586_CR42","doi-asserted-by":"publisher","unstructured":"Noel, S., Jajodia, S., O\u2019Berry, B., Jacobs, M.: Efficient minimum-cost network hardening via exploit dependency graphs. In: 19th Annual Computer Security Applications Conference, 2003. Proceedings., pp. 86\u201395. IEEE (2003). https:\/\/doi.org\/10.1109\/CSAC.2003.1254313. URL http:\/\/ieeexplore.ieee.org\/document\/1254313\/","DOI":"10.1109\/CSAC.2003.1254313"},{"key":"586_CR43","unstructured":"Ou, X.: A Logic-programming Approach to Network Security Analysis. PhD thesis, Princeton University, USA (2005)"},{"key":"586_CR44","unstructured":"Ou, X., Govindavajhala, S., Appel, A.W.: MulVAL: a logic-based network security analyzer. In: Proceedings of the 14th Conference on USENIX Security Symposium, vol. 14. (2005). URL https:\/\/www.usenix.org\/conference\/14th-usenix-security-symposium\/mulval-logic-based-network-security-analyzer"},{"key":"586_CR45","doi-asserted-by":"publisher","unstructured":"Ou, X., Boyer, W.F., McQueen, M.A.: A scalable approach to attack graph generation. In: Proceedings of the 13th ACM Conference on Computer and Communications Security - CCS \u201906, pp. 336\u2013345. ACM Press, New York, USA, (2006) . ISBN 1595935185. https:\/\/doi.org\/10.1145\/1180405.1180446. URL http:\/\/dl.acm.org\/citation.cfm?doid=1180405.1180446","DOI":"10.1145\/1180405.1180446"},{"key":"586_CR46","doi-asserted-by":"publisher","unstructured":"Phillips, C., Swiler, L.P.: A Graph-based System for Network-vulnerability Analysis. In: Proceedings of the 1998 Workshop on New Security Paradigms, pp. 71\u201379. (1998). ISBN 1-58113-168-2. https:\/\/doi.org\/10.1145\/310889.310919","DOI":"10.1145\/310889.310919"},{"issue":"1","key":"586_CR47","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TDSC.2011.34","volume":"9","author":"N Poolsappasit","year":"2012","unstructured":"Poolsappasit, N., Dewri, R., Ray, I.: Dynamic security risk management using bayesian attack graphs. IEEE Trans. Dependable Secure Comput. 9(1), 61\u201374 (2012). https:\/\/doi.org\/10.1109\/TDSC.2011.34","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"586_CR48","unstructured":"Rahman, M.A., Al-Shaer, E.: A formal approach for network security management based on qualitative risk analysis. In: Proceedings of the 2013 IFIP\/IEEE International Symposium on Integrated Network Management, IM 2013, pp. 244\u2013251. (2013)"},{"issue":"2","key":"586_CR49","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1109\/TPDS.2016.2585108","volume":"28","author":"MA Rahman","year":"2017","unstructured":"Rahman, M.A., Al-Shaer, E.: automated synthesis of distributed network access controls: a formal framework with refinement. IEEE Trans. Parallel Distrib. Syst. 28(2), 416\u2013430 (2017). https:\/\/doi.org\/10.1109\/TPDS.2016.2585108","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"586_CR50","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/CSAC.2002.1176275","volume":"2002","author":"R Ritchey","year":"2002","unstructured":"Ritchey, R., O\u2019Berry, B., Noel, S.: Representing TCP\/IP connectivity for topological analysis of network security. Proc. Ann. Comput. Secur. Appl. Conf. ACSAC 2002, 25\u201331 (2002). https:\/\/doi.org\/10.1109\/CSAC.2002.1176275","journal-title":"Proc. Ann. Comput. Secur. Appl. Conf. ACSAC"},{"key":"586_CR51","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2012.6263940","author":"A Roy","year":"2012","unstructured":"Roy, A., Kim, D.S., Trivedi, K.S.: Scalable optimal countermeasure selection using implicit enumeration on attack countermeasure trees. Proc. Int. Conf. Depend. Syst. Netw. (2012). https:\/\/doi.org\/10.1109\/DSN.2012.6263940","journal-title":"Proc. Int. Conf. Depend. Syst. Netw."},{"issue":"8","key":"586_CR52","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1002\/sec.299","volume":"5","author":"A Roy","year":"2012","unstructured":"Roy, A., Kim, D.S., Trivedi, K.S.: Attack countermeasure trees (ACT): towards unifying the constructs of attack and defense trees. Secur. Commun. Netw. 5(8), 929\u2013943 (2012). https:\/\/doi.org\/10.1002\/sec.299","journal-title":"Secur. Commun. Netw."},{"key":"586_CR53","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455780","author":"D Saha","year":"2008","unstructured":"Saha, D.: Extending logical attack graphs for efficient vulnerability analysis. Proc. ACM Conf. Comput. Commun. Secur. (2008). https:\/\/doi.org\/10.1145\/1455770.1455780","journal-title":"Proc. ACM Conf. Comput. Commun. Secur."},{"key":"586_CR54","first-page":"1816","volume":"3","author":"C Sarraute","year":"2012","unstructured":"Sarraute, C., Buffet, O., Hoffmann, J.: POMDPs make better hackers: accounting for uncertainty in penetration testing. Proc. Natl. Conf. Artif. Intell. 3, 1816\u20131824 (2012)","journal-title":"Proc. Natl. Conf. Artif. Intell."},{"key":"586_CR55","doi-asserted-by":"crossref","unstructured":"Schneier, B.: Attack Trees. Secrets and Lies: Digital Security in a Networked World, pp. 318\u2013333. (2015)","DOI":"10.1002\/9781119183631.ch21"},{"issue":"3","key":"586_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699907","volume":"17","author":"E Serra","year":"2015","unstructured":"Serra, E., Jajodia, S., Pugliese, A., Rullo, A., Subrahmanian, V.S.: Pareto-optimal adversarial defense of enterprise systems. ACM Trans. Inf. Syst. Secur. 17(3), 1\u201339 (2015). https:\/\/doi.org\/10.1145\/2699907","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"586_CR57","doi-asserted-by":"publisher","unstructured":"Silver, D., Veness, J.: Monte-Carlo planning in large POMDPs. In: Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 2, vol. 23, pp. 2164\u20132172. (2010). https:\/\/doi.org\/10.5555\/2997046.2997137","DOI":"10.5555\/2997046.2997137"},{"key":"586_CR58","doi-asserted-by":"crossref","unstructured":"Speicher, P., Steinmetz, M., Backes, M., Hoffmann, J., K\u00fcnnemann, R.: Stackelberg planning: towards effective leader-follower state space search. In: 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, pp. 6286\u20136293. (2018)","DOI":"10.1609\/aaai.v32i1.12090"},{"key":"586_CR59","doi-asserted-by":"publisher","unstructured":"Speicher, P., Steinmetz, M., Kunnemann, R., Simeonovski, M., Pellegrino, G., Hoffmann, J., Backes, M.: Formally reasoning about the cost and efficacy of securing the email infrastructure. In: Proceedings - 3rd IEEE European Symposium on Security and Privacy, EURO S and P 2018, pp. 77\u201391. (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00014","DOI":"10.1109\/EuroSP.2018.00014"},{"key":"586_CR60","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1145\/3297280.3297473","volume":"Part F1477","author":"P Speicher","year":"2019","unstructured":"Speicher, P., Steinmetz, M., Hoffmann, J., Backes, M., K\u00fcnnemann, R.: Towards automated network mitigation analysis. Proc. ACM Symp. Appl. Comput. Part F1477, 1971\u20131978 (2019). https:\/\/doi.org\/10.1145\/3297280.3297473","journal-title":"Proc. ACM Symp. Appl. Comput."},{"issue":"c","key":"586_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TDSC.2020.3041999","volume":"5971","author":"O Stan","year":"2020","unstructured":"Stan, O., Bitton, R., Ezrets, M., Dadon, M., Inokuchi, M., Yoshinobu, O., Tomohiko, Y., Elovici, Y., Shabtai, A.: extending attack graphs to represent cyber-attacks in communication protocols and modern IT networks. IEEE Trans. Depend. Secure Comput. 5971(c), 1\u201318 (2020). https:\/\/doi.org\/10.1109\/TDSC.2020.3041999","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"586_CR62","doi-asserted-by":"publisher","unstructured":"Stan, O., Bitton, R., Ezrets, M., Dadon, M., Inokuchi, M., Ohta, Y., Yagyu, T., Elovici, Y., Shabtai, A.: Heuristic Approach for Countermeasure Selection Using Attack Graphs, pp. 1\u201316. (2021). https:\/\/doi.org\/10.1109\/csf51468.2021.00003","DOI":"10.1109\/csf51468.2021.00003"},{"key":"586_CR63","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-23829-6_1","volume":"152","author":"X Sun","year":"2015","unstructured":"Sun, X., Dai, J., Singhal, A., Liu, P.: Inferring the stealthy bridges between enterprise network islands in cloud using cross-layer bayesian networks. Lecture Notes Inst. Comput. Sci. Soc.-Inf. Telecommun. Eng. LNICST 152, 3\u201323 (2015). https:\/\/doi.org\/10.1007\/978-3-319-23829-6_1","journal-title":"Lecture Notes Inst. Comput. Sci. Soc.-Inf. Telecommun. Eng. LNICST"},{"key":"586_CR64","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-61176-1_14","volume-title":"Data and Applications Security and Privacy XXXI","author":"X Sun","year":"2017","unstructured":"Sun, X., Singhal, A., Liu, P.: Towards actionable mission impact assessment in the context of cloud computing. In: Livraga, G., Zhu, S. (eds.) Data and Applications Security and Privacy XXXI, pp. 259\u2013274. Springer, Cham (2017)"},{"key":"586_CR65","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/DISCEX.2001.932182","volume":"2","author":"LP Swiler","year":"2001","unstructured":"Swiler, L.P., Phillips, C., Ellis, D., Chakerian, S.: Computer-attack graph generation tool. Proc. DARPA Inf. Surviv. Conf. Expo. II, DISCEX 2001 2, 307\u2013321 (2001). https:\/\/doi.org\/10.1109\/DISCEX.2001.932182","journal-title":"Proc. DARPA Inf. Surviv. Conf. Expo. II, DISCEX 2001"},{"issue":"3","key":"586_CR66","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.dss.2012.04.001","volume":"53","author":"V Viduto","year":"2012","unstructured":"Viduto, V., Maple, C., Huang, W., L\u00f3Pez-Per\u00e9Z, D.: A novel risk assessment and optimisation model for a multi-objective network security countermeasure selection problem. Decis. Support Syst. 53(3), 599\u2013610 (2012)","journal-title":"Decis. Support Syst."},{"issue":"18","key":"586_CR67","doi-asserted-by":"publisher","first-page":"3812","DOI":"10.1016\/j.comcom.2006.06.018","volume":"29","author":"L Wang","year":"2006","unstructured":"Wang, L., Noel, S., Jajodia, S.: Minimum-cost network hardening using attack graphs. Comput. Commun. 29(18), 3812\u20133824 (2006). https:\/\/doi.org\/10.1016\/j.comcom.2006.06.018","journal-title":"Comput. Commun."},{"key":"586_CR68","doi-asserted-by":"publisher","unstructured":"Wang, L., Islam, T., Long, T., Singhal, A., Jajodia, S.: An attack graph-based probabilistic security metric. In: IFIP Annual Conference on Data and Applications Security and Privacy, pp. 283\u2013296. 2008. ISBN 978-3-540-70567-3. https:\/\/doi.org\/10.1007\/978-3-540-70567-3_22","DOI":"10.1007\/978-3-540-70567-3_22"},{"issue":"61100156","key":"586_CR69","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cose.2012.09.013","volume":"32","author":"S Wang","year":"2013","unstructured":"Wang, S., Zhang, Z., Kadobayashi, Y.: Exploring attack graph for cost-benefit security hardening: a probabilistic approach. Comput. Secur. 32(61100156), 158\u2013169 (2013). https:\/\/doi.org\/10.1016\/j.cose.2012.09.013","journal-title":"Comput. Secur."},{"key":"586_CR70","doi-asserted-by":"publisher","unstructured":"While, L., Hingston, P., Barone, L., Huband, S.: A faster algorithm for calculating hypervolume. IEEE Trans. Evol. Comput. 10(1), 29\u201338 (2006). https:\/\/doi.org\/10.1109\/TEVC.2005.851275","DOI":"10.1109\/TEVC.2005.851275"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00586-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-022-00586-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00586-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T12:01:37Z","timestamp":1659096097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-022-00586-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,30]]},"references-count":70,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1007\/s10207-022-00586-7","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,30]]},"assertion":[{"value":"30 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}