{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:28:01Z","timestamp":1773480481069,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10207-020-00533-4","type":"journal-article","created":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T09:03:51Z","timestamp":1614416631000},"page":"37-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Automatic analysis of attack graphs for risk mitigation and prioritization on large-scale and complex networks in Industry 4.0"],"prefix":"10.1007","volume":"21","author":[{"given":"George","family":"Stergiopoulos","sequence":"first","affiliation":[]},{"given":"Panagiotis","family":"Dedousis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7793-6128","authenticated-orcid":false,"given":"Dimitris","family":"Gritzalis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"key":"533_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2014.07.001","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. Comput. Sci. Rev. 13\u201314, 1\u201338 (2014). https:\/\/doi.org\/10.1016\/j.cosrev.2014.07.001","journal-title":"Comput. Sci. Rev."},{"key":"533_CR2","unstructured":"Acunetix: (2008) http:\/\/www.acunetix.com\/vulnerability-scanner\/"},{"key":"533_CR3","unstructured":"Deraison, R.: Nessus (1999). https:\/\/www.tenable.com\/products\/nessus"},{"key":"533_CR4","unstructured":"BS ISO\/IEC 27001: Information technology\u2013security techniques\u2013information security management systems\u2013requirements (2013)"},{"key":"533_CR5","unstructured":"Cerotti, D., Raiteri, D.C., Dondossola, G., Egidi, L., Franceschinis, G., Portinale, L., Terruggia, R.: A Bayesian network approach for the interpretation of cyber attacks to power systems. In: ITASEC (2019)"},{"key":"533_CR6","first-page":"58","volume":"33","author":"S Sanders","year":"2018","unstructured":"Sanders, S., Border, C.: Private cloud deployment with docker and kubernetes. J. Comput. Sci. Coll. 33, 58\u201359 (2018)","journal-title":"J. Comput. Sci. Coll."},{"key":"533_CR7","doi-asserted-by":"crossref","unstructured":"Ou, X., Boyer, W., McQueen, M.: A scalable approach to attack graph generation. In: Proceedings of the 13th ACM Conference on Computer and Communications Security\u2014CCS\u201906. pp. 336\u2013345. ACM Press, USA (2006)","DOI":"10.1145\/1180405.1180446"},{"key":"533_CR8","unstructured":"Whitcombe, M.: What is attack graph mapping (2020) https:\/\/www.f-secure.com\/en\/consulting\/our-thinking\/what-is-attack-path-mapping"},{"key":"533_CR9","doi-asserted-by":"crossref","unstructured":"Ammann, P., Wijesekera, D., Kaushik, S.: Scalable, graph-based network vulnerability analysis. In: Proceedings of the 9th ACM conference on Computer and communications security\u2014CCS\u201902, p. 217. ACM Press, Washington, DC, USA (2002)","DOI":"10.1145\/586110.586140"},{"key":"533_CR10","doi-asserted-by":"crossref","unstructured":"Ingols, K., Lippmann, R., Piwowarski, K.: Practical attack graph generation for network defense. In: 2006 22nd Annual Computer Security Applications Conference (ACSAC\u201906). pp. 121\u2013130. IEEE, USA (2006)","DOI":"10.1109\/ACSAC.2006.39"},{"key":"533_CR11","unstructured":"Noel, S., Jajodia, S., O\u2019Berry, B., Jacobs, M.: Efficient minimum-cost network hardening via exploit dependency graphs. In: Proceedings of the 19th Annual Computer Security Applications Conference. p. 86. IEEE Computer Society, USA (2003)"},{"key":"533_CR12","doi-asserted-by":"crossref","unstructured":"Phillips, C., Swiler, L.P.: A graph-based system for network-vulnerability analysis. In: Proceedings of the 1998 Workshop on New security paradigms\u2014NSPW\u201998. pp. 71\u201379. ACM Press, USA (1998)","DOI":"10.1145\/310889.310919"},{"key":"533_CR13","unstructured":"Sheyner, O., Haines, J., Jha, S., Lippmann, R., Wing, J.: Automated generation and analysis of attack graphs. In: Proceedings 2002 IEEE Symposium on Security and Privacy. pp. 273\u2013284. IEEE Comput. Soc, USA (2002)"},{"key":"533_CR14","doi-asserted-by":"crossref","unstructured":"Noel, S., Jajodia, S.: Managing attack graph complexity through visual hierarchical aggregation. In: Proceedings of the 2004 ACM Workshop on Visualization and Data Mining for Computer Security\u2014VizSEC\/DMSEC\u201904. p. 109. ACM Press, USA (2004)","DOI":"10.1145\/1029208.1029225"},{"key":"533_CR15","doi-asserted-by":"crossref","unstructured":"Sawilla, R., Ou, X.: Identifying Critical Attack Assets in Dependency Attack Graphs. In: Computer Security\u2014ESORICS 2008. pp. 18\u201334. Springe (2008)","DOI":"10.1007\/978-3-540-88313-5_2"},{"key":"533_CR16","doi-asserted-by":"crossref","unstructured":"Jajodia, S., Noel, S., O\u2019Berry, B.: Topological analysis of network attack vulnerability. In: Managing Cyber Threats. pp. 247\u2013266. Springer-Verlag, New York (2005)","DOI":"10.1007\/0-387-24230-9_9"},{"key":"533_CR17","unstructured":"Tidwell, T., Larson, R., Fitch, K., Hale, J.: Modeling internet attacks. In: Proceedings of the 2001 IEEE Workshop on Information Assurance and security. United States Military Academy, USA (2001)"},{"key":"533_CR18","doi-asserted-by":"crossref","unstructured":"Ibrahim A, Bozhinoski S, Pretschner A (2019) Attack graph generation for microservice architecture. In: Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing. pp. 1235\u20131242. ACM, Cyprus (2019)","DOI":"10.1145\/3297280.3297401"},{"key":"533_CR19","doi-asserted-by":"crossref","unstructured":"Liu, C., Singhal, A., Wijesekera, D.: Mapping evidence graphs to attack graphs. In: 2012 IEEE International Workshop on Information Forensics and Security (WIFS). pp. 121\u2013126 (2012)","DOI":"10.1109\/WIFS.2012.6412636"},{"key":"533_CR20","doi-asserted-by":"crossref","unstructured":"Lippmann, R., Ingols, K.: An Annotated review of past papers on attack graphs. Presented at the (2005)","DOI":"10.21236\/ADA431826"},{"key":"533_CR21","doi-asserted-by":"crossref","unstructured":"Musa, T., Yeo, K., Azam, S., Shanmugam, B., Karim, A., Boer, F., Nur, F., Faisal, F.: Analysis of complex networks for security issues using attack graph. In: 2019 International Conference on Computer Communication and Informatics (ICCCI). pp. 1\u20136. IEEE, India (2019)","DOI":"10.1109\/ICCCI.2019.8822179"},{"key":"533_CR22","doi-asserted-by":"crossref","unstructured":"Ivanov, D., Kalinin, M., Krundyshev, V., Orel, E.: Automatic security management of smart infrastructures using attack graph and risk analysis. In: 2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4). pp. 295\u2013300. IEEE, United Kingdom (2020)","DOI":"10.1109\/WorldS450073.2020.9210410"},{"key":"533_CR23","doi-asserted-by":"publisher","first-page":"3488","DOI":"10.1109\/TSMC.2019.2915940","volume":"50","author":"A Al Ghazo","year":"2020","unstructured":"Al Ghazo, A., Ibrahim, M., Ren, H., Kumar, R.: A2G2V: automatic attack graph generation and visualization and its applications to computer and SCADA networks. IEEE Trans. Syst. Man Cybern. Syst. 50, 3488\u20133498 (2020). https:\/\/doi.org\/10.1109\/TSMC.2019.2915940","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"533_CR24","doi-asserted-by":"crossref","unstructured":"Ibrahim, M., Alsheikh, A., Al-Hindawi, Q.: Automatic attack graph generation for industrial controlled systems. In: Recent Developments on Industrial Control Systems Resilience. pp. 99\u2013116. Springer International Publishing, Cham (2020)","DOI":"10.1007\/978-3-030-31328-9_5"},{"key":"533_CR25","unstructured":"Ou, X., Govindavajhala, S.: Mulval: A logic-based network security analyzer. In: In 14th USENIX Security Symposium. pp. 113\u2013128 (2005)"},{"key":"533_CR26","doi-asserted-by":"publisher","first-page":"735","DOI":"10.15676\/ijeei.2015.7.4.15","volume":"7","author":"M Ramadhan","year":"2015","unstructured":"Ramadhan, M., Gondokaryono, Y., Arman, A.: Network Security Risk Analysis using Improved MulVAL Bayesian Attack Graphs. IJEEI 7, 735\u2013753 (2015). https:\/\/doi.org\/10.15676\/ijeei.2015.7.4.15","journal-title":"IJEEI"},{"key":"533_CR27","unstructured":"Noel, S., Jacobs, M., Pramod, K. Jajodia, S.: Multiple coordinated views for network attack graphs. In: IEEE Workshop on Visualization for Computer Security, 2005. (VizSEC 05). pp. 99\u2013106 (2005)"},{"key":"533_CR28","doi-asserted-by":"crossref","unstructured":"Williams L, Lippmann R, Ingols K (2008) An Interactive Attack Graph Cascade and Reachability Display. In: VizSEC 2007: Proceedings of the Workshop on Visualization for Computer Security. pp. 221\u2013236. Springer (2008)","DOI":"10.1007\/978-3-540-78243-8_15"},{"key":"533_CR29","doi-asserted-by":"crossref","unstructured":"Dewri, R., Poolsappasit, N., Ray, I., Whitley, D.: Optimal security hardening using multi-objective optimization on attack tree models of networks. In: Proceedings of the 14th ACM conference on Computer and communications security\u2014CCS\u201907. p. 204. ACM Press, USA (2007)","DOI":"10.1145\/1315245.1315272"},{"key":"533_CR30","unstructured":"Homer, J.: A sound and practical approach to quantifying security risk in enterprise networks. In: CiteSeerX (2009)"},{"key":"533_CR31","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ijcip.2015.12.002","volume":"12","author":"G Stergiopoulos","year":"2016","unstructured":"Stergiopoulos, G., Kotzanikolaou, P., Theocharidou, M., Lykou, G., Gritzalis, D.: Time-based critical infrastructure dependency analysis for large-scale and cross-sectoral failures. Int. J. Crit. Infrastruct. Prot. 12, 46\u201360 (2016). https:\/\/doi.org\/10.1016\/j.ijcip.2015.12.002","journal-title":"Int. J. Crit. Infrastruct. Prot."},{"key":"533_CR32","doi-asserted-by":"publisher","first-page":"101869","DOI":"10.1016\/j.cose.2020.101869","volume":"96","author":"G Stergiopoulos","year":"2020","unstructured":"Stergiopoulos, G., Dedousis, P., Gritzalis, D.: Automatic network restructuring and risk mitigation through business process asset dependency analysis. Comput. Secur. 96, 101869 (2020). https:\/\/doi.org\/10.1016\/j.cose.2020.101869","journal-title":"Comput. Secur."},{"key":"533_CR33","doi-asserted-by":"publisher","first-page":"e0220061","DOI":"10.1371\/journal.pone.0220061","volume":"14","author":"S Oldham","year":"2019","unstructured":"Oldham, S., Fulcher, B., Parkes, L., Arnatkevic\u0306i\u016bt\u0117, A., Suo, C., Fornito, A.: Consistency and differences between centrality measures across distinct classes of networks. PLoS ONE. 14, e0220061 (2019). https:\/\/doi.org\/10.1371\/journal.pone.0220061","journal-title":"PLoS ONE."},{"key":"533_CR34","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ijcip.2015.05.003","volume":"10","author":"G Stergiopoulos","year":"2015","unstructured":"Stergiopoulos, G., Kotzanikolaou, P., Theocharidou, M., Gritzalis, D.: Risk mitigation strategies for critical infrastructures based on graph centrality analysis. Int. J. Crit. Infrastruct. Prot. 10, 34\u201344 (2015). https:\/\/doi.org\/10.1016\/j.ijcip.2015.05.003","journal-title":"Int. J. Crit. Infrastruct. Prot."},{"key":"533_CR35","unstructured":"Common Vulnerability and Exposures (MITRE) (2020). https:\/\/cve.mitre.org\/cve\/"},{"key":"533_CR36","unstructured":"National Vulnerability Database (NIST) (2020). https:\/\/nvd.nist.gov\/"},{"key":"533_CR37","unstructured":"NIST SP 800-30: Guide for conducting risk assessments. National Institute of Standards and Technology, USA (2012)"},{"key":"533_CR38","unstructured":"Jha, S., Sheyner, O., Wing, J.: Two formal analyses of attack graphs. In: Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15. pp. 49\u201363. IEEE, Canada (2002)"},{"key":"533_CR39","doi-asserted-by":"publisher","DOI":"10.1504\/IJCIS.2013.051606","author":"P Kotzanikolaou","year":"2013","unstructured":"Kotzanikolaou, P., Theoharidou, M., Gritzalis, D.: Assessing n-order dependencies between critical infrastructures. IJCIS. (2013). https:\/\/doi.org\/10.1504\/IJCIS.2013.051606","journal-title":"IJCIS."},{"key":"533_CR40","doi-asserted-by":"crossref","unstructured":"Kotzanikolaou, P., Theoharidou, M., Gritzalis, D.: Interdependencies between critical infrastructures: analyzing the risk of cascading effects. In: Critical Information Infrastructure Security. pp. 104\u2013115. Springer (2013)(b)","DOI":"10.1007\/978-3-642-41476-3_9"},{"key":"533_CR41","first-page":"1396","volume":"14","author":"YJ Chu","year":"1965","unstructured":"Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396\u20131400 (1965)","journal-title":"Sci. Sinica"},{"key":"533_CR42","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stan. Sect. B. Math. Math. Phys. 71B, 233 (1967). https:\/\/doi.org\/10.6028\/jres.071B.032","journal-title":"J. Res. Natl. Bur. Stan. Sect. B. Math. Math. Phys."},{"key":"533_CR43","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/net.3230200306","volume":"20","author":"M Guignard","year":"1990","unstructured":"Guignard, M., Rosenwein, M.: An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks 20, 345\u2013359 (1990). https:\/\/doi.org\/10.1002\/net.3230200306","journal-title":"Networks"},{"key":"533_CR44","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1287\/opre.32.2.380","volume":"32","author":"G Carpaneto","year":"1984","unstructured":"Carpaneto, G., Martello, S., Toth, P.: An algorithm for the bottleneck traveling salesman problem. Oper. Res. 32, 380\u2013389 (1984). https:\/\/doi.org\/10.1287\/opre.32.2.380","journal-title":"Oper. Res."},{"key":"533_CR45","doi-asserted-by":"publisher","first-page":"e0190825","DOI":"10.1371\/journal.pone.0190825","volume":"13","author":"M Coscia","year":"2018","unstructured":"Coscia, M.: Using arborescences to estimate hierarchicalness in directed complex networks. PLoS ONE 13, e0190825 (2018). https:\/\/doi.org\/10.1371\/journal.pone.0190825","journal-title":"PLoS ONE"},{"key":"533_CR46","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/mnsc.17.9.568","volume":"17","author":"F Glover","year":"1971","unstructured":"Glover, F.: Flows in arborescences. Manage. Sci. 17, 568\u2013586 (1971). https:\/\/doi.org\/10.1287\/mnsc.17.9.568","journal-title":"Manage. Sci."},{"key":"533_CR47","doi-asserted-by":"crossref","unstructured":"Korte, B., Vygen, J.: Spanning trees and arborescences. In: Combinatorial Optimization. pp. 131\u2013155. Springer (2012)","DOI":"10.1007\/978-3-642-24488-9_6"},{"key":"533_CR48","unstructured":"Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. Dev. Oper. Res. 29\u201344 (1971)"},{"key":"533_CR49","doi-asserted-by":"crossref","unstructured":"Jungnickel, D.: Spanning trees. In: Graphs, networks and algorithms. pp. 99\u2013123. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-32278-5"},{"key":"533_CR50","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/net.3230090403","volume":"9","author":"P Camerini","year":"1979","unstructured":"Camerini, P., Fratta, L., Maffioli, F.: A note on finding optimum branchings. Networks 9, 309\u2013312 (1979). https:\/\/doi.org\/10.1002\/net.3230090403","journal-title":"Networks"},{"key":"533_CR51","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H Gabow","year":"1986","unstructured":"Gabow, H., Galil, Z., Spencer, T., Tarjan, R.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109\u2013122 (1986). https:\/\/doi.org\/10.1007\/BF02579168","journal-title":"Combinatorica"},{"key":"533_CR52","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M Fredman","year":"1987","unstructured":"Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596\u2013615 (1987). https:\/\/doi.org\/10.1145\/28869.28874","journal-title":"J. ACM"},{"key":"533_CR53","doi-asserted-by":"crossref","unstructured":"Dwivedi, A., Yu, X., Sokolowski, P.: Analyzing power network vulnerability with maximum flow-based centrality approach. In: 2010 8th IEEE International Conference on Industrial Informatics. pp. 336\u2013341. IEEE, Japan (2010)","DOI":"10.1109\/INDIN.2010.5549398"},{"key":"533_CR54","doi-asserted-by":"crossref","unstructured":"Kiesling, S., Kl\u00fcnder, J., Fischer, D., Schneider, K., Fischbach, K.: Applying social network analysis and centrality measures to improve information flow analysis. In: Product-Focused Software Process Improvement. pp. 379\u2013386. Springer International Publishing, Cham (2016)","DOI":"10.1007\/978-3-319-49094-6_25"},{"key":"533_CR55","doi-asserted-by":"crossref","unstructured":"Maccari, L., Nguyen, Q., Lo Cigno, R.: On the computation of centrality metrics for network security in mesh networks. In: 2016 IEEE Global Communications Conference (GLOBECOM). pp. 1\u20136. IEEE, USA (2016)","DOI":"10.1109\/GLOCOM.2016.7842049"},{"key":"533_CR56","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/90.650138","volume":"5","author":"E Zegura","year":"1997","unstructured":"Zegura, E., Calvert, K., Donahoo, M.: A quantitative comparison of graph-based models for Internet topology. IEEE\/ACM Trans. Netw. 5, 770\u2013783 (1997)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"533_CR57","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas, A.: Communication patterns in task-oriented groups. J. Acoust. Soc. Am. 22, 725\u2013730 (1950). https:\/\/doi.org\/10.1121\/1.1906679","journal-title":"J. Acoust. Soc. Am."},{"key":"533_CR58","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Xiao, Y.: Managing and mining large graphs: systems and implementations. In: Proceedings of the 2012 International Conference on Management of Data\u2014SIGMOD\u201912. p. 589. ACM Press, USA (2012)","DOI":"10.1145\/2213836.2213907"},{"key":"533_CR59","doi-asserted-by":"crossref","unstructured":"Vicknair, C., Macias, M., Zhao, Z., Nan, X., Chen, Y., Wilkins, D.: A comparison of a graph database and a relational database: a data provenance perspective. In: Proceedings of the 48th Annual Southeast Regional Conference on\u2014ACM SE\u201910. p. 1. ACM Press, USA (2010)","DOI":"10.1145\/1900008.1900067"},{"key":"533_CR60","doi-asserted-by":"publisher","DOI":"10.18420\/BTW2019-23","author":"D Allen","year":"2019","unstructured":"Allen, D., Hodler, A., Hunger, M., Knobloch, M., Lyon, W., Needham, M., Voigt, H.: Understanding trolls with efficient analytics of large graphs in Neo4j. BTW (2019). https:\/\/doi.org\/10.18420\/BTW2019-23","journal-title":"BTW"},{"key":"533_CR61","doi-asserted-by":"crossref","unstructured":"Geepalla, E., Asharif, S.: Analysis of Physical Access Control System for Understanding Users Behavior and Anomaly Detection Using Neo4j. In: Proceedings of the 6th International Conference on Engineering and MIS 2020. pp. 1\u20136. ACM, Kazakhstan (2020)","DOI":"10.1145\/3410352.3410817"},{"key":"533_CR62","doi-asserted-by":"crossref","unstructured":"Jouili, S., Vansteenberghe, V.: An empirical comparison of graph databases. In: 2013 International Conference on Social Computing. pp. 708\u2013715. IEEE, USA (2013)","DOI":"10.1109\/SocialCom.2013.106"},{"key":"533_CR63","doi-asserted-by":"crossref","unstructured":"Ugurel, S., Krovetz, R., Giles, C.: What\u2019s the code? Automatic classification of source code archives. In: Proceedings of the eighth ACM SIGKDD International Conference on Knowledge discovery and Data Mining\u2014KDD\u201902. p. 632. ACM Press, Canada (2002)","DOI":"10.1145\/775047.775141"},{"key":"533_CR64","doi-asserted-by":"publisher","unstructured":"Kolomi\u010denko, V., Svoboda, M., & Ml\u00fdnkov\u00e1, I. H.: Experimental comparison of graph databases. In: Proceedings of International Conference on Information Integration and Web-Based Applications & Services\u2014IIWAS\u201913. pp. 115\u2013124. (2013). https:\/\/doi.org\/10.1145\/2539150.2539155","DOI":"10.1145\/2539150.2539155"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00533-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-020-00533-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-020-00533-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T13:15:23Z","timestamp":1644498923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-020-00533-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,27]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1007\/s10207-020-00533-4","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,27]]},"assertion":[{"value":"27 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"None of the authors have received any research grants. None of the authors have received a speaker honorarium from any company. All authors declare that none of them has any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}