{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:11:34Z","timestamp":1743109894497,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030154646"},{"type":"electronic","value":"9783030154653"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-15465-3_6","type":"book-chapter","created":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T04:02:37Z","timestamp":1553918557000},"page":"90-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Attacker Does not Always Hold the Initiative: Attack Trees with External Refinement"],"prefix":"10.1007","author":[{"given":"Ross","family":"Horne","sequence":"first","affiliation":[]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,31]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. J. Symbolic Logic 59(2), 543\u2013574 (1994). \n                    https:\/\/doi.org\/10.2307\/2275407","journal-title":"J. Symbolic Logic"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Abramsky, S., Jagadeesan, R.: Game semantics for access control. In: Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009) Electronic Notes in Theoretical Computer Science, vol. 249, pp. 135\u2013156 (2009). \n                    https:\/\/doi.org\/10.1016\/j.entcs.2009.07.088","DOI":"10.1016\/j.entcs.2009.07.088"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Abramsky, S., Melli\u00e8s, P.-A.: Concurrent games and full completeness. In: 14th Annual IEEE Symposium on Logic in Computer Science LICS, Trento, Italy, 2\u20135 July 1999, pp. 431\u2013442. IEEE Computer Society (1999). \n                    https:\/\/doi.org\/10.1109\/LICS.1999.782638","DOI":"10.1109\/LICS.1999.782638"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J-M Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. Logic Comput. 2(3), 297\u2013347 (1992). \n                    https:\/\/doi.org\/10.1093\/logcom\/2.3.297","journal-title":"J. Logic Comput."},{"key":"6_CR5","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). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46666-7_6"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Aslanyan, Z., Nielson, F., Parker, D.: Quantitative verification and synthesis of attack-defence scenarios. In: 2016 IEEE 29th Computer Security Foundations Symposium (CSF), pp. 105\u2013119. IEEE Computer Society (2016). \n                    https:\/\/doi.org\/10.1109\/CSF.2016.15","DOI":"10.1109\/CSF.2016.15"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-66402-6_7","volume-title":"Computer Security \u2013 ESORICS 2017","author":"M Audinot","year":"2017","unstructured":"Audinot, M., Pinchinat, S., Kordy, B.: Is my attack tree correct? In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10492, pp. 83\u2013102. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66402-6_7"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1215\/S0012-7094-37-00334-X","volume":"3","author":"G Birkhoff","year":"1937","unstructured":"Birkhoff, G.: Rings of sets. Duke Math. J. 3(3), 443\u2013454 (1937). \n                    https:\/\/doi.org\/10.1215\/S0012-7094-37-00334-X","journal-title":"Duke Math. J."},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Bistarelli, S., Fioravanti, F., Peretti, P.: Defense trees for economic evaluation of security investments. In: First International Conference on Availability, Reliability and Security (ARES 2006), pp. 416\u2013423. IEEE Computer Society (2006). \n                    https:\/\/doi.org\/10.1109\/ARES.2006.46","DOI":"10.1109\/ARES.2006.46"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","volume":"56","author":"A Blass","year":"1992","unstructured":"Blass, A.: A game semantics for linear logic. Ann. Pure Appl. Logic 56(1), 183\u2013220 (1992). \n                    https:\/\/doi.org\/10.1016\/0168-0072(92)90073-9","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984). \n                    https:\/\/doi.org\/10.1145\/828.833","journal-title":"J. ACM"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11962977_19","volume-title":"Critical Information Infrastructures Security","author":"A Buldas","year":"2006","unstructured":"Buldas, A., Laud, P., Priisalu, J., Saarepera, M., Willemson, J.: Rational choice of security measures via multi-parameter attack trees. In: Lopez, J. (ed.) CRITIS 2006. LNCS, vol. 4347, pp. 235\u2013248. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11962977_19"},{"key":"6_CR13","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-0-387-09680-3_26","volume-title":"Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008","author":"K Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Miller, D., Saurin, A.: Canonical sequent proofs via multi-focusing. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) TCS 2008. IIFIP, vol. 273, pp. 383\u2013396. Springer, Boston, MA (2008). \n                    https:\/\/doi.org\/10.1007\/978-0-387-09680-3_26"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/507382.507385","volume":"3","author":"V Danos","year":"2002","unstructured":"Danos, V., Harmer, R.S.: Probabilistic game semantics. ACM Trans. Comput. Logic (TOCL) 3(3), 359\u2013382 (2002). \n                    https:\/\/doi.org\/10.1145\/507382.507385","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11576280_10","volume-title":"Formal Methods and Software Engineering","author":"M Debbabi","year":"2005","unstructured":"Debbabi, M., Saleh, M.: Game semantics model for security protocols. In: Lau, K.-K., Banach, R. (eds.) ICFEM 2005. LNCS, vol. 3785, pp. 125\u2013140. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/11576280_10"},{"issue":"5","key":"6_CR16","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.apal.2009.07.017","volume":"161","author":"O Delande","year":"2010","unstructured":"Delande, O., Miller, D., Saurin, A.: Proof and refutation in MALL as a game. Ann. Pure Appl. Logic 161(5), 654\u2013672 (2010). \n                    https:\/\/doi.org\/10.1016\/j.apal.2009.07.017","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Deswarte, Y., Blain, L., Fabre, J.C.: Intrusion tolerance in distributed computing systems. In: Proceedings of 1991 IEEE Computer Society Symposium on Research in Security and Privacy, pp. 110\u2013121, May 1991. \n                    https:\/\/doi.org\/10.1109\/RISP.1991.130780","DOI":"10.1109\/RISP.1991.130780"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-11851-2_6","volume-title":"Security and Trust Management","author":"AS Dimovski","year":"2014","unstructured":"Dimovski, A.S.: Ensuring secure non-interference of programs by game semantics. In: Mauw, S., Jensen, C.D. (eds.) STM 2014. LNCS, vol. 8743, pp. 81\u201396. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-11851-2_6"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-44878-7_3","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O Gadyatskaya","year":"2016","unstructured":"Gadyatskaya, O., Hansen, R.R., Larsen, K.G., Legay, A., Olesen, M.C., Poulsen, D.B.: Modelling attack-defense trees using timed automata. In: Fr\u00e4nzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 35\u201350. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-44878-7_3"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-68063-7_11","volume-title":"Security and Trust Management","author":"O Gadyatskaya","year":"2017","unstructured":"Gadyatskaya, O., Jhawar, R., Mauw, S., Trujillo-Rasua, R., Willemse, T.A.C.: Refinement-aware generation of attack trees. In: Livraga, G., Mitchell, C. (eds.) STM 2017. LNCS, vol. 10547, pp. 164\u2013179. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-68063-7_11"},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoret. comput. Sci. 50(1), 1\u2013101 (1987). \n                    https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theoret. comput. Sci."},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Heijltjes, W., Hughes, D.J.: Complexity bounds for sum-product logic via additive proof nets and petri nets. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6\u201310 July 2015, pp. 80\u201391. IEEE Computer Society (2015). \n                    https:\/\/doi.org\/10.1109\/LICS.2015.18","DOI":"10.1109\/LICS.2015.18"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-662-49635-0_9","volume-title":"Principles of Security and Trust","author":"H Hermanns","year":"2016","unstructured":"Hermanns, H., Kr\u00e4mer, J., Kr\u010d\u00e1l, J., Stoelinga, M.: The value of attack-defence diagrams. In: Piessens, F., Vigan\u00f2, L. (eds.) POST 2016. LNCS, vol. 9635, pp. 163\u2013185. Springer, Heidelberg (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-662-49635-0_9"},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.7561\/SACS.2015.2.245","volume":"25","author":"R Horne","year":"2015","unstructured":"Horne, R.: The consistency and complexity of multiplicative additive system virtual. Sci. Ann. Comput. Sci. 25(2), 245 (2015). \n                    https:\/\/doi.org\/10.7561\/SACS.2015.2.245","journal-title":"Sci. Ann. Comput. Sci."},{"issue":"1\u20132","key":"6_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.3233\/FI-2017-1531","volume":"153","author":"R Horne","year":"2017","unstructured":"Horne, R., Mauw, S., Tiu, A.: Semantics for specialising attack trees based on linear logic. Fund. Inform. 153(1\u20132), 57\u201386 (2017). \n                    https:\/\/doi.org\/10.3233\/FI-2017-1531","journal-title":"Fund. Inform."},{"key":"6_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0977-9","volume-title":"Moving Target Defense: Creating Asymmetric Uncertainty for Cyber Threats","author":"S Jajodia","year":"2011","unstructured":"Jajodia, S., Ghosh, A.K., Swarup, V., Wang, C., Wang, X.S.: Moving Target Defense: Creating Asymmetric Uncertainty for Cyber Threats, vol. 54. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-1-4614-0977-9"},{"key":"6_CR27","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-18467-8_23","volume-title":"ICT Systems Security and Privacy Protection","author":"R Jhawar","year":"2015","unstructured":"Jhawar, R., Kordy, B., Mauw, S., Radomirovi\u0107, S., Trujillo-Rasua, R.: Attack trees with sequential conjunction. In: Federrath, H., Gollmann, D. (eds.) SEC 2015. IAICT, vol. 455, pp. 339\u2013353. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-18467-8_23"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Jiang, R., Luo, J., Wang, X.: An attack tree based risk assessment for location privacy in wireless sensor networks. In: WiCOM, pp. 1\u20134 (2012). \n                    https:\/\/doi.org\/10.1109\/WiCOM.2012.6478402","DOI":"10.1109\/WiCOM.2012.6478402"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-17197-0_17","volume-title":"Decision and Game Theory for Security","author":"B Kordy","year":"2010","unstructured":"Kordy, B., Mauw, S., Melissen, M., Schweitzer, P.: Attack\u2013defense trees and two-player binary zero-sum extensive form games are equivalent. In: Alpcan, T., Butty\u00e1n, L., Baras, J.S. (eds.) GameSec 2010. LNCS, vol. 6442, pp. 245\u2013256. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-17197-0_17"},{"issue":"1","key":"6_CR30","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. Logic Comput. 24(1), 55\u201387 (2014). \n                    https:\/\/doi.org\/10.1093\/logcom\/exs029","journal-title":"J. Logic Comput."},{"key":"6_CR31","first-page":"1","volume":"13\u201314","author":"B Kordy","year":"2014","unstructured":"Kordy, B., Pi\u00e8tre-Cambac\u00e9d\u00e8s, L., Schweitzer, P.: DAG-based attack and defense modeling: don\u2019t miss the forest for the attack trees. C. S. Rev. 13\u201314, 1\u201338 (2014)","journal-title":"C. S. Rev."},{"issue":"1\u20133","key":"6_CR32","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.apal.2004.04.006","volume":"130","author":"O Laurent","year":"2004","unstructured":"Laurent, O.: Polarized games. Ann. Pure Appl. Logic 130(1\u20133), 79\u2013123 (2004). \n                    https:\/\/doi.org\/10.1016\/j.apal.2004.04.006","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR33","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). \n                    https:\/\/doi.org\/10.1007\/11734727_17"},{"key":"6_CR34","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., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 231\u2013246. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/11555827_14"},{"issue":"8","key":"6_CR35","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: towards unifying the constructs of attack and defense trees. Secur. Commun. Netw. 5(8), 929\u2013943 (2012). \n                    https:\/\/doi.org\/10.1002\/sec.299","journal-title":"Secur. Commun. Netw."},{"issue":"12","key":"6_CR36","first-page":"21","volume":"24","author":"B Schneier","year":"1999","unstructured":"Schneier, B.: Attack trees. Dr. Dobb\u2019s J. 24(12), 21\u201329 (1999)","journal-title":"Dr. Dobb\u2019s J."},{"issue":"2","key":"6_CR37","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/TPDS.2013.211","volume":"25","author":"SA Zonouz","year":"2014","unstructured":"Zonouz, S.A., Khurana, H., Sanders, W.H., Yardley, T.M.: RRE: a game-theoretic intrusion response and recovery engine. IEEE Trans. Parallel Distrib. Syst. 25(2), 395\u2013406 (2014). \n                    https:\/\/doi.org\/10.1109\/TPDS.2013.211","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Graphical Models for Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15465-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:35:17Z","timestamp":1558341317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15465-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030154646","9783030154653"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15465-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"31 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GraMSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graphical Models for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gramsec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.gramsec.uni.lu\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}