{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T00:10:02Z","timestamp":1748995802063,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319414829"},{"type":"electronic","value":"9783319414836"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41483-6_21","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T11:09:11Z","timestamp":1467371351000},"page":"295-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Diversifying Network Services Under Cost Constraints for Better Resilience Against Unknown Attacks"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Borbor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anoop","family":"Singhal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Albanese, M., Jajodia, S., Noel, S.: Time-efficient and cost-effective network hardening using attack graphs. In: 2012 42nd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 1\u201312. IEEE (2012)","DOI":"10.1109\/DSN.2012.6263942"},{"key":"21_CR2","doi-asserted-by":"crossref","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, pp. 217\u2013224. ACM (2002)","DOI":"10.1145\/586110.586140"},{"key":"21_CR3","unstructured":"Avizienis, A., Chen, L.: On the implementation of n-version programming for software fault tolerance during execution. In: Proceedings of the IEEE COMPSAC, vol. 77, pp. 149\u2013155 (1977)"},{"key":"21_CR4","unstructured":"Azamathulla, H.Md., Wu, F.-C., Ghani, A.A., Narulkar, S.M., Zakaria, N.A., Chang, C.K.: Comparison between genetic algorithm and linear programming approach for real time operation. J. Hydro-Env. Res. 2(3), 172\u2013181 (2008)"},{"key":"21_CR5","unstructured":"Cox, B., Evans, D., Filipi, A., Rowanhill, J., Wei, H., Davidson, J., Knight, J., Nguyen-Tuong, A., Hiser, J.: N-variant systems: a secretless framework for security through diversity. In: Usenix Security, vol. 6, pp. 105\u2013120 (2006)"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186(2), 311\u2013338 (2000)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"21_CR7","doi-asserted-by":"crossref","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, pp. 204\u2013213. ACM (2007)","DOI":"10.1145\/1315245.1315272"},{"issue":"3","key":"21_CR8","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)","journal-title":"Int. J. Inf. Secur."},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11856214_2","volume-title":"Recent Advances in Intrusion Detection","author":"D Gao","year":"2006","unstructured":"Gao, D., Reiter, M.K., Song, D.: Behavioral distance measurement using hidden markov models. In: Zamboni, D., Kruegel, C. (eds.) RAID 2006. LNCS, vol. 4219, pp. 19\u201340. Springer, Heidelberg (2006)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Garcia, M., Bessani, A., Gashi, I., Neves, N., Obelheiro, R.: Os diversity for intrusion tolerance: myth or reality? In: 2011 IEEE\/IFIP 41st International Conference on Dependable Systems & Networks (DSN), pp. 383\u2013394. IEEE (2011)","DOI":"10.1109\/DSN.2011.5958251"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.dss.2004.06.004","volume":"41","author":"M Gupta","year":"2006","unstructured":"Gupta, M., Rees, J., Chaturvedi, A., Chi, J.: Matching information security vulnerabilities to organizational security profiles: a genetic algorithm approach. Decis. Support Syst. 41(3), 592\u2013603 (2006)","journal-title":"Decis. Support Syst."},{"key":"21_CR12","unstructured":"Jajodia, S., Noel, S., O\u2019Berry, B.: Topological analysis of network attack vulnerability. In: Kumar, V., Srivastava, J., Lazarevic, A. (eds.) Managing Cyber Threats: Issues, Approaches and Challenges. Kluwer Academic Publisher (2003)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"McHugh, J.: Quality of protection: measuring the unmeasurable? In: Proceedings of the 2nd ACM Workshop on Quality of Protection, pp. 1\u20132. ACM (2006)","DOI":"10.1145\/1179494.1179495"},{"issue":"1","key":"21_CR14","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. Depend. Secure Comput. 9(1), 61\u201374 (2012)","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"21_CR15","unstructured":"Penetration testing virtual labs, September 2015. https:\/\/www.offensive-security.com\/offensive-securitysolutions\/virtual-penetration-testing-labs"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/11555827_14","volume-title":"Computer Security \u2013 ESORICS 2005","author":"I Ray","year":"2005","unstructured":"Ray, I., Poolsapassit, N.: Using attack trees to identify malicious attacks from authorized insiders. In: di Vimercati, S.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 231\u2013246. Springer, Heidelberg (2005)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Sheyner, O., Haines, J., Jha, S., Lippmann, R., Wing, J.M.: Automated generation and analysis of attack graphs. In: Proceedings of the 2002 IEEE Symposium on Security and Privacy, pp. 273\u2013284. IEEE (2002)","DOI":"10.1109\/SECPRI.2002.1004377"},{"key":"21_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04612-9","volume-title":"Network Hardening: An Automated Approach to Improving Network Security","author":"L Wang","year":"2014","unstructured":"Wang, L., Albanese, M., Jajodia, S.: Network Hardening: An Automated Approach to Improving Network Security. Springer Publishing Company, Incorporated, Heidelberg (2014)"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/TDSC.2013.24","volume":"11","author":"L Wang","year":"2014","unstructured":"Wang, L., Jajodia, S., Singhal, A., Cheng, P., Noel, S.: k-zero day safety: a network security metric for measuring the risk of unknown vulnerabilities. IEEE Trans. Depend. Secure Comput. 11(1), 30\u201344 (2014)","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-642-15497-3_35","volume-title":"Computer Security \u2013 ESORICS 2010","author":"L Wang","year":"2010","unstructured":"Wang, L., Jajodia, S., Singhal, A., Noel, S.: k-zero day safety: measuring the security risk of networks against unknown attacks. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 573\u2013587. Springer, Heidelberg (2010)"},{"issue":"18","key":"21_CR21","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)","journal-title":"Comput. Commun."},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-73538-0_9","volume-title":"Data and Applications Security XXI","author":"L Wang","year":"2007","unstructured":"Wang, L., Singhal, A., Jajodia, S.: Measuring the overall security of network configurations using attack graphs. In: Barker, S., Ahn, G.-J. (eds.) Data and Applications Security 2007. LNCS, vol. 4602, pp. 98\u2013112. Springer, Heidelberg (2007)"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/978-3-319-11212-1_28","volume-title":"Computer Security - ESORICS 2014","author":"L Wang","year":"2014","unstructured":"Wang, L., Zhang, M., Jajodia, S., Singhal, A., Albanese, M.: Modeling network diversity for evaluating the robustness of networks against zero-day attacks. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ICAIS 2014, Part II. LNCS, vol. 8713, pp. 494\u2013511. Springer, Heidelberg (2014)"},{"key":"21_CR24","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, 158\u2013169 (2013)","journal-title":"Comput. Secur."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Yigit, B., Gur, G., Alagoz, F.: Cost-aware network hardening with limited budget using compact attack graphs. In: 2014 IEEE Military Communications Conference (MILCOM), pp. 152\u2013157. IEEE (2014)","DOI":"10.1109\/MILCOM.2014.31"},{"issue":"5","key":"21_CR26","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1109\/TIFS.2016.2516916","volume":"11","author":"M Zhang","year":"2016","unstructured":"Zhang, M., Wang, L., Jajodia, S., Singhal, A., Albanese, M.: Network diversity: a security metric for evaluating the resilience of networks against zero-day attacks. IEEE Trans. Inf. Forensics Secur. (TIFS) 11(5), 1071\u20131086 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur. (TIFS)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41483-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:33:16Z","timestamp":1748993596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41483-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319414829","9783319414836"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41483-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}