{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:56:15Z","timestamp":1760597775852,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319668444"},{"type":"electronic","value":"9783319668451"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66845-1_22","type":"book-chapter","created":{"date-parts":[[2017,8,26]],"date-time":"2017-08-26T11:37:20Z","timestamp":1503747440000},"page":"332-347","source":"Crossref","is-referenced-by-count":14,"title":["How Well Can I Secure My System?"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kordy","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Wide\u0142","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,27]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-46666-7_6","volume-title":"Principles of Security and Trust","author":"Z Aslanyan","year":"2015","unstructured":"Aslanyan, Z., Nielson, F.: Pareto efficient solutions of attack-defence trees. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 95\u2013114. Springer, Heidelberg (2015). doi:\n10.1007\/978-3-662-46666-7_6"},{"key":"22_CR2","unstructured":"Berkelaar, M., Eikland, K., Notebaert, P.: lp_solve: Open source (Mixed-Integer) Linear Programming system (2005). \nhttp:\/\/lpsolve.sourceforge.net\/5.5\/\n\n version 5.5.2.5, Accessed Sep 2016"},{"key":"22_CR3","volume-title":"Linear Programming","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear Programming. W.H Freeman, San Francisco (1983)"},{"key":"22_CR4","unstructured":"DiskCryptor: (2014). \nhttps:\/\/diskcryptor.net\/\n\n Accessed 17 March 2017"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-43425-4_10","volume-title":"Quantitative Evaluation of Systems","author":"O Gadyatskaya","year":"2016","unstructured":"Gadyatskaya, O., Jhawar, R., Kordy, P., Lounis, K., Mauw, S., Trujillo-Rasua, R.: Attack trees for practical security assessment: ranking of attack scenarios with ADTool 2.0. In: Agha, G., Houdt, B. (eds.) QEST 2016. LNCS, vol. 9826, pp. 159\u2013162. Springer, Cham (2016). doi:\n10.1007\/978-3-319-43425-4_10"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/logcom\/exs029","volume":"24","author":"B Kordy","year":"2014","unstructured":"Kordy, B., Mauw, S., Radomirovic, S., Schweitzer, P.: Attack-defense trees. J. Log. Comput. 24(1), 55\u201387 (2014). doi:\n10.1093\/logcom\/exs029","journal-title":"J. Log. Comput."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.ins.2016.01.010","volume":"342","author":"B Kordy","year":"2016","unstructured":"Kordy, B., Pouly, M., Schweitzer, P.: Probabilistic reasoning with graphical security models. Inf. Sci. 342, 111\u2013131 (2016). doi:\n10.1016\/j.ins.2016.01.010","journal-title":"Inf. Sci."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11734727_17","volume-title":"Information Security and Cryptology - ICISC 2005","author":"S Mauw","year":"2006","unstructured":"Mauw, S., Oostdijk, M.: Foundations of attack trees. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 186\u2013198. Springer, Heidelberg (2006). doi:\n10.1007\/11734727_17"},{"key":"22_CR9","unstructured":"Ophcrack: (2016). \nhttp:\/\/ophcrack.sourceforge.net\/\n\n Accessed 17 March 2017"},{"issue":"12","key":"22_CR10","first-page":"21","volume":"24","author":"B Schneier","year":"1999","unstructured":"Schneier, B.: Attack trees: modeling security threats. Dr. Dobb\u2019s J. Softw. Tools 24(12), 21\u201329 (1999)","journal-title":"Dr. Dobb\u2019s J. Softw. Tools"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/TDSC.2016.2615622","volume":"99","author":"A Shameli-Sendi","year":"2016","unstructured":"Shameli-Sendi, A., Louafi, H., He, W., Cheriet, M.: Dynamic optimal countermeasure selection for intrusion response system. IEEE J. TDSC 99, 10\u201314 (2016). doi:\n10.1109\/TDSC.2016.2615622","journal-title":"IEEE J. TDSC"},{"key":"22_CR12","unstructured":"Zheng, K., McLay, L.A., Luedtke, J.R.: A budgeted maximum multiple coverage model for cybersecurity planning and management (2017, under submission)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66845-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,26]],"date-time":"2017-08-26T11:43:46Z","timestamp":1503747826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66845-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319668444","9783319668451"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66845-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}