{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T10:51:32Z","timestamp":1778151092653,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642171963","type":"print"},{"value":"9783642171970","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17197-0_17","type":"book-chapter","created":{"date-parts":[[2010,11,22]],"date-time":"2010-11-22T10:35:06Z","timestamp":1290422106000},"page":"245-256","source":"Crossref","is-referenced-by-count":28,"title":["Attack\u2013Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kordy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthijs","family":"Melissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Secrets and lies","author":"B. Schneier","year":"2004","unstructured":"Schneier, B.: Secrets and lies. Wiley, Indianapolis (2004)"},{"key":"17_CR2","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":"2005","unstructured":"Mauw, S., Oostdijk, M.: Foundations of Attack Trees. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol.\u00a03935, pp. 186\u2013198. Springer, Heidelberg (2005)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-14423-3_9","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"J. Willemson","year":"2010","unstructured":"Willemson, J., J\u00fcrgenson, A.: Serial Model for Attack Tree Computations. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 118\u2013128. Springer, Heidelberg (2010)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-04342-0_4","volume-title":"RAID","author":"M. Reh\u00e1k","year":"2009","unstructured":"Reh\u00e1k, M., Staab, E., Fusenig, V., P\u011bchou\u010dek, M., Grill, M., Stiborek, J., Barto\u0161, K., Engel, T.: Runtime Monitoring and Dynamic Reconfiguration for Intrusion Detection Systems. In: Kirda, E., Jha, S., Balzarotti, D. (eds.) RAID 2009. LNCS, vol.\u00a05758, pp. 61\u201380. Springer, Heidelberg (2009)"},{"key":"17_CR5","unstructured":"Amenaza: SecurITree, \n                    \n                      http:\/\/www.amenaza.com\/"},{"key":"17_CR6","unstructured":"Isograph: AttackTree+, \n                    \n                      http:\/\/www.isograph-software.com\/atpover.htm"},{"key":"17_CR7","first-page":"1","volume-title":"MILCOM","author":"K.S. Edge","year":"2006","unstructured":"Edge, K.S., Dalton II, G.C., Raines, R.A., Mills, R.F.: Using Attack and Protection Trees to Analyze Threats and Defenses to Homeland Security. In: MILCOM, pp. 1\u20137. IEEE, Los Alamitos (2006)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Formal Aspects in Security and Trust","author":"S. Bistarelli","year":"2006","unstructured":"Bistarelli, S., Dall\u2019Aglio, M., Peretti, P.: Strategic Games on Defense Trees. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol.\u00a04691, pp. 1\u201315. Springer, Heidelberg (2006)"},{"key":"17_CR9","series-title":"LNCS","volume-title":"FAST","author":"B. Kordy","year":"2010","unstructured":"Kordy, B., Mauw, S., Radomirovi\u0107, S., Schweitzer, P.: Foundations of Attack\u2013Defense Trees. In: FAST. LNCS. Springer, Heidelberg (2010), \n                    \n                      http:\/\/satoss.uni.lu\/members\/barbara\/papers\/adt.pdf"},{"key":"17_CR10","unstructured":"Kordy, B., Mauw, S., Melissen, M., Schweitzer, P.: Attack\u2013defense trees and two-player binary zero-sum extensive form games are equivalent \u2013 technical report with proofs, \n                    \n                      http:\/\/arxiv.org\/abs\/1006.2732"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17197-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T05:43:21Z","timestamp":1553233401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17197-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171963","9783642171970"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17197-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}