{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:32:04Z","timestamp":1725805924122},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126005"},{"type":"electronic","value":"9783319126012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12601-2_9","type":"book-chapter","created":{"date-parts":[[2014,10,3]],"date-time":"2014-10-03T08:16:39Z","timestamp":1412324199000},"page":"155-174","source":"Crossref","is-referenced-by-count":2,"title":["Limiting Adversarial Budget in Quantitative Security Assessment"],"prefix":"10.1007","author":[{"given":"Aleksandr","family":"Lenin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahto","family":"Buldas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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: L\u00f3pez, J. (ed.) CRITIS 2006. LNCS, vol.\u00a04347, pp. 235\u2013248. Springer, Heidelberg (2006)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-02786-9_12","volume-title":"Decision and Game Theory for Security","author":"A. Buldas","year":"2013","unstructured":"Buldas, A., Lenin, A.: New efficient utility upper bounds for the fully adaptive model of attack trees. In: Das, S.K., Nita-Rotaru, C., Kantarcioglu, M. (eds.) GameSec 2013. LNCS, vol.\u00a08252, pp. 192\u2013205. Springer, Heidelberg (2013)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-34266-0_6","volume-title":"Decision and Game Theory for Security","author":"A. Buldas","year":"2012","unstructured":"Buldas, A., Stepanenko, R.: Upper bounds for adversaries\u2019 utility in attack trees. In: Grossklags, J., Walrand, J. (eds.) GameSec 2012. LNCS, vol.\u00a07638, pp. 98\u2013117. Springer, Heidelberg (2012)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1007\/978-3-540-88873-4_8","volume-title":"On the Move to Meaningful Internet Systems: OTM 2008","author":"A. J\u00fcrgenson","year":"2008","unstructured":"J\u00fcrgenson, A., Willemson, J.: Computing exact outcomes of multi-parameter attack trees. In: Meersman, R., Tari, Z. (eds.) OTM 2008, Part II. LNCS, vol.\u00a05332, pp. 1036\u20131051. Springer, Heidelberg (2008)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-12827-1_5","volume-title":"Information Security, Practice and Experience","author":"A. J\u00fcrgenson","year":"2010","unstructured":"J\u00fcrgenson, A., Willemson, J.: On fast and approximate attack tree computations. In: Kwak, J., Deng, R.H., Won, Y., Wang, G. (eds.) ISPEC 2010. LNCS, vol.\u00a06047, pp. 56\u201366. Springer, Heidelberg (2010)"},{"key":"9_CR6","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., Kim, S. (eds.) ICISC 2005. LNCS, vol.\u00a03935, pp. 186\u2013198. Springer, Heidelberg (2006)"},{"key":"9_CR7","unstructured":"Schneier, B.: Attack trees. Dr. Dobb\u2019s Journal of Software Tools\u00a024(12), 21\u201322, 24, 26, 28\u201329 (1999)"}],"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-319-12601-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T01:42:30Z","timestamp":1559007750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12601-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126005","9783319126012"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12601-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}