{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:51:31Z","timestamp":1750859491581},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319641997"},{"type":"electronic","value":"9783319642000"}],"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-64200-0_3","type":"book-chapter","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T12:58:41Z","timestamp":1501073921000},"page":"39-55","source":"Crossref","is-referenced-by-count":3,"title":["Simple Infeasibility Certificates for Attack Trees"],"prefix":"10.1007","author":[{"given":"Ahto","family":"Buldas","sequence":"first","affiliation":[]},{"given":"Aleksandr","family":"Lenin","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Willemson","sequence":"additional","affiliation":[]},{"given":"Anton","family":"Charnamord","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,27]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10107-011-0499-2","volume":"137","author":"AA Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Olshevsky, A., Parrilo, P.A., Tsitsiklis, J.N.: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137(1), 453\u2013476 (2013)","journal-title":"Math. Program."},{"key":"3_CR2","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). doi:\n10.1007\/11962977_19"},{"key":"3_CR3","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. 8252, pp. 192\u2013205. Springer, Cham (2013). doi:\n10.1007\/978-3-319-02786-9_12"},{"key":"3_CR4","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. 7638, pp. 98\u2013117. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-34266-0_6"},{"key":"3_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611972290","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2012","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.R.: Semidefinite Optimization and Convex Algebraic Geometry. Society for Industrial and Applied Mathematics, Philadelphia (2012)"},{"key":"3_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-68103-8_5","volume-title":"Types for Proofs and Programs","author":"P Corbineau","year":"2008","unstructured":"Corbineau, P.: A declarative language for the Coq proof assistant. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol. 4941, pp. 69\u201384. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-68103-8_5"},{"issue":"11","key":"3_CR8","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1016\/j.jsc.2011.08.007","volume":"46","author":"JA Loera De","year":"2011","unstructured":"De Loera, J.A., Lee, J., Malkin, P.N., Margulies, S.: Computing infeasibility certificates for combinatorial problems through hilbert\u2019s nullstellensatz. J. Symb. Comput. 46(11), 1260\u20131283 (2011)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"3_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"JW Helton","year":"2010","unstructured":"Helton, J.W., Nie, J.: Semidefinite representation of convex sets. Math. Program. 122(1), 21\u201364 (2010)","journal-title":"Math. Program."},{"issue":"6","key":"3_CR10","doi-asserted-by":"crossref","first-page":"4:51","DOI":"10.1145\/2512329","volume":"60","author":"C Hillar","year":"2013","unstructured":"Hillar, C., Lim, L.-H.: Most tensor problems are np-hard. J. ACM 60(6), 4:51\u201345:39 (2013)","journal-title":"J. ACM"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol. 5332, pp. 1036\u20131051. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-88873-4_8"},{"key":"3_CR12","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":"A J\u00fcrgenson","year":"2010","unstructured":"J\u00fcrgenson, A., Willemson, J.: Serial model for attack tree computations. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 118\u2013128. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14423-3_9"},{"key":"3_CR13","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. 6047, pp. 56\u201366. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-12827-1_5"},{"key":"3_CR14","volume-title":"Reliable and Efficient Determination of the Likelihood of Rational Attacks","author":"A Lenin","year":"2015","unstructured":"Lenin, A.: Reliable and Efficient Determination of the Likelihood of Rational Attacks. TUT Press, Tallinn (2015)"},{"key":"3_CR15","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":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-78800-3_24"},{"key":"3_CR17","unstructured":"Prajna, S., Papachristodoulou, A., Seiler, P., Parrilo, P.A.: Sostools: Sum of squares optimization toolbox for matlab (2004)"},{"key":"3_CR18","unstructured":"Schneier, B.: Attack trees. Dr. Dobb\u2019s J. Softw. Tools 24(12), 21\u201322, 24, 26, 28\u201329, December 1999"},{"key":"3_CR19","series-title":"Universitext","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4497-2","volume-title":"An Invitation to Algebraic Geometry","author":"KE Smith","year":"2000","unstructured":"Smith, K.E., Kahanp\u00e4\u00e4, L., Kek\u00e4l\u00e4inen, P., et al.: An Invitation to Algebraic Geometry. Universitext. Springer Science + Business Media, New York (2000)"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01362149","volume":"207","author":"G Stengle","year":"1974","unstructured":"Stengle, G.: A nullstellensatz and a positivstellensatz in semialgebraic geometry. Math. Ann. 207, 87\u201398 (1974)","journal-title":"Math. Ann."},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01362149","volume":"207","author":"G Stengle","year":"1994","unstructured":"Stengle, G.: A nullstellensatz and positivstellensatz in semialgebraic geometry. Math. Ann. 207, 87\u201397 (1994)","journal-title":"Math. Ann."}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64200-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T12:59:22Z","timestamp":1501073962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64200-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319641997","9783319642000"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64200-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}