{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:44:08Z","timestamp":1769921048121,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031477478","type":"print"},{"value":"9783031477485","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47748-5_8","type":"book-chapter","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:04:15Z","timestamp":1699401855000},"page":"126-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mean Value Analysis of\u00a0Critical Attack Paths with\u00a0Multiple Parameters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0479-6766","authenticated-orcid":false,"given":"Rajendra Shivaji","family":"Patil","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2764-8099","authenticated-orcid":false,"given":"Viktoria","family":"Fodor","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3922-9606","authenticated-orcid":false,"given":"Mathias","family":"Ekstedt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ammann, P., Wijesekera, D., Kaushik, S.: Scalable, graph-based network vulnerability analysis. In: 9th ACM Conference on Computer and Communications Security, pp. 217\u2013224 (2002)","DOI":"10.1145\/586110.586140"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Li, W., Vaughn, R.B.: Cluster security research involving the modeling of network exploitations using exploitation graphs. In: 6th IEEE International Symposium on Cluster Computing and the Grid, vol. 2, p. 26 (2006)","DOI":"10.1109\/CCGRID.2006.1630921"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Sheyner, O., Haines, J., Jha, S., Lippmann, R., Wing, J.M.: Automated generation and analysis of attack graphs. In: IEEE Symposium on Security & Privacy, pp. 273\u2013284 (2002)","DOI":"10.1109\/SECPRI.2002.1004377"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Fila, B., Widel, W.: Efficient attack-defense tree analysis using pareto attribute domains. In: 32nd IEEE Computer Security Foundations Symposium, pp. 200\u2013215 (2019)","DOI":"10.1109\/CSF.2019.00021"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TDSC.2010.61","volume":"9","author":"N Idika","year":"2010","unstructured":"Idika, N., Bhargava, B.: Extending attack graph-based security metrics and aggregating their application. IEEE Trans. Dependable Secure Comput. 9(1), 75\u201385 (2010)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MSP.2008.9","volume":"6","author":"DJ Leversage","year":"2008","unstructured":"Leversage, D.J., Byres, E.J.: Estimating a system\u2019s mean time-to-compromise. IEEE Secur. Priv. 6(1), 52\u201360 (2008)","journal-title":"IEEE Secur. Priv."},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"2704","DOI":"10.1109\/COMST.2017.2745505","volume":"19","author":"A Ramos","year":"2017","unstructured":"Ramos, A., Lazar, M., Holanda Filho, R., Rodrigues, J.J.: Model-based quantitative network security metrics: a survey. IEEE Commun. Surv. Tutor. 19(4), 2704\u20132734 (2017)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"8_CR8","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). https:\/\/doi.org\/10.1007\/978-3-662-46666-7_6"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/opre.17.4.583","volume":"17","author":"H Frank","year":"1969","unstructured":"Frank, H.: Shortest paths in probabilistic graphs. Oper. Res. 17(4), 583\u2013599 (1969)","journal-title":"Oper. Res."},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1287\/trsc.20.3.182","volume":"20","author":"RW Hall","year":"1986","unstructured":"Hall, R.W.: The fastest path through a network with random time-dependent travel times. Transp. Sci. 20(3), 182\u2013188 (1986)","journal-title":"Transp. Sci."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1023\/B:JOTH.0000013560.69722.c1","volume":"120","author":"D Rasteiro","year":"2004","unstructured":"Rasteiro, D., Anjo, A.: Optimal paths in probabilistic networks. J. Math. Sci. 120(1), 974\u2013987 (2004)","journal-title":"J. Math. Sci."},{"issue":"26","key":"8_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.7250\/csimq.2021-26.04","volume":"151","author":"W Xiong","year":"2021","unstructured":"Xiong, W., Hacks, S., Lagerstrom, R.: A method for assigning probability distributions in attack simulation languages. Complex Syst. Inform. Model. Q. 151(26), 55\u201377 (2021)","journal-title":"Complex Syst. Inform. Model. Q."},{"issue":"5","key":"8_CR13","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1287\/opre.11.5.839","volume":"11","author":"RM Van Slyke","year":"1963","unstructured":"Van Slyke, R.M.: Monte Carlo methods and the pert problem. Oper. Res. 11(5), 839\u2013860 (1963)","journal-title":"Oper. Res."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-62230-5_4","volume-title":"Graphical Models for Security","author":"S Katsikeas","year":"2020","unstructured":"Katsikeas, S., et al.: An attack simulation language for the IT domain. In: Eades III, H., Gadyatskaya, O. (eds.) GraMSec 2020. LNCS, vol. 12419, pp. 67\u201386. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62230-5_4"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cose.2023.103284","volume":"130","author":"W Wide\u0142","year":"2023","unstructured":"Wide\u0142, W., Hacks, S., Ekstedt, M., Johnson, P., Lagerstr\u00f6m, R.: The meta attack language - a formal description. Comput. Secur. 130, 1\u201312 (2023)","journal-title":"Comput. Secur."},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/net.3230160303","volume":"16","author":"VG Kulkarni","year":"1986","unstructured":"Kulkarni, V.G.: Shortest paths in networks with exponentially distributed arc lengths. Networks 16(3), 255\u2013274 (1986)","journal-title":"Networks"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/trsc.35.1.37.10141","volume":"35","author":"S Sen","year":"2001","unstructured":"Sen, S., Pillai, R., Joshi, S., Rathi, A.K.: A mean-variance model for route guidance in advanced traveler information systems. Transp. Sci. 35(1), 37\u201349 (2001)","journal-title":"Transp. Sci."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.trb.2015.04.002","volume":"81","author":"A Khani","year":"2015","unstructured":"Khani, A., Boyles, S.D.: An exact algorithm for the mean-standard deviation shortest path problem. Transp. Res. Part B: Methodol. 81, 252\u2013266 (2015)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.cor.2007.10.016","volume":"36","author":"KR Hutson","year":"2009","unstructured":"Hutson, K.R., Shier, D.R.: Extended dominance and a stochastic shortest path problem. Comput. Oper. Res. 36(2), 584\u2013596 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Hartley, R.: Vector optimal routing by dynamic programming. Math. Multi Objective Optim. 215\u2013224 (1985)","DOI":"10.1007\/978-3-7091-2822-0_10"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of pareto optima in multiple-objective, shortest-path problems. Oper. Res. 35(1), 70\u201379 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0377-2217(92)90248-8","volume":"62","author":"CT Tung","year":"1992","unstructured":"Tung, C.T., Chew, K.L.: A multicriteria pareto-optimal path algorithm. Eur. J. Oper. Res. 62(2), 203\u2013209 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/03052158808941204","volume":"14","author":"N Sancho","year":"1988","unstructured":"Sancho, N.: A new type of multi-objective routing problem. Eng. Optim. 14(2), 115\u2013119 (1988)","journal-title":"Eng. Optim."},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0377-2217(93)90142-A","volume":"65","author":"AB Wijeratne","year":"1993","unstructured":"Wijeratne, A.B., Turnquist, M.A., Mirchandani, P.B.: Multiobjective routing of hazardous materials in stochastic networks. Eur. J. Oper. Res. 65(1), 33\u201343 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10288-005-0074-x","volume":"4","author":"X Gandibleux","year":"2006","unstructured":"Gandibleux, X., Beugnies, F., Randriamasy, S.: Martins\u2019 algorithm revisited for multi-objective shortest path problems with a maxmin cost function. 4OR 4(1), 47\u201359 (2006)","journal-title":"4OR"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Sarraute, C., Richarte, G., Lucangeli Obes, J.: An algorithm to find optimal attack paths in nondeterministic scenarios. In: 4th ACM Workshop on Security and Artificial Intelligence, pp. 71\u201380 (2011)","DOI":"10.1145\/2046684.2046695"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Johnson, P., Lagerstrom, R., Ekstedt, M.: A meta language for threat modeling and attack simulations. In: 13th ACM International Conference on Availability, Reliability and Security, pp. 1\u20138 (2018)","DOI":"10.1145\/3230833.3232799"},{"key":"8_CR29","unstructured":"Steuer, R.: Multiple Criteria Optimization: Theory, Computation, and Application. WILEY Series in Probability and Mathematical Statistics. Wiley, Hoboken (1986)"},{"issue":"1","key":"8_CR30","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"11","key":"8_CR31","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."},{"issue":"2","key":"8_CR32","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"8_CR33","unstructured":"Al Zoobi, A., Coudert, D., Nisse, N.: Space and time trade-off for the k shortest simple paths problem. In: 18th International Symposium on Experimental Algorithms, vol. 160, pp. 1\u201313 (2020)"},{"issue":"2","key":"8_CR34","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/12.663776","volume":"47","author":"M Barbehenn","year":"1998","unstructured":"Barbehenn, M.: A note on the complexity of Dijkstra\u2019s algorithm for graphs with weighted vertices. IEEE Trans. Comput. 47(2), 263 (1998)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"8_CR35","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/TCS.1978.1084515","volume":"25","author":"F Rubin","year":"1978","unstructured":"Rubin, F.: Enumerating all simple paths in a graph. IEEE Trans. Circ. Syst. 25(8), 641\u2013642 (1978)","journal-title":"IEEE Trans. Circ. Syst."}],"container-title":["Lecture Notes in Computer Science","Secure IT Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47748-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T16:00:55Z","timestamp":1730476855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47748-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,8]]},"ISBN":["9783031477478","9783031477485"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47748-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,8]]},"assertion":[{"value":"8 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NordSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nordic Conference on Secure IT Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nordsec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uni.oslomet.no\/nordsec2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}