DOCSLIB.ORG

DAG-Based Attack and Defense Modeling: Don’T Miss the Forest for the Attack Trees

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
DAG-Based Attack and Defense Modeling: Don’T Miss the Forest for the Attack Trees COMPUTERSCIENCEREVIEW ( ) ± Available online at www.sciencedirect.com ScienceDirect journal homepage: www.elsevier.com/locate/cosrev Survey DAG-based attack and defense modeling: Don’t miss the forest for the attack trees Barbara Kordya,b,∗, Ludovic Piètre­Cambacédèsc, Patrick Schweitzera a University of Luxembourg, SnT, 6, rue Coudenhove­Kalergi, 1359, Luxembourg b IRISA, INSA Rennes, Campus Beaulieu, 35042 Rennes, France c EDF France, Research and Development Department, 1, avenue Général de Gaulle, 92141 Clamart, France HIGHLIGHTS • We present an overview of attack and defense modeling techniques based on DAGs. • We summarize existing methodologies and compare their features. • We propose a taxonomy of the described formalisms. • We support the selection of a modeling technique depending on user requirements. • We point out future research directions in the field of graphical security modeling. ARTICLEINFO ABSTRACT Article history: This paper presents the current state of the art on attack and defense modeling approaches Received 23 May 2013 that are based on directed acyclic graphs (DAGs). DAGs allow for a hierarchical decomposition Received in revised form of complex scenarios into simple, easily understandable and quantifiable actions. Methods 18 July 2014 based on threat trees and Bayesian networks are two well­known approaches to security Accepted 20 July 2014 modeling. However there exist more than 30 DAG­based methodologies, each having different features and goals. Keywords: The objective of this survey is to summarize the existing methodologies, compare their Graphical models for security features, and propose a taxonomy of the described formalisms. This article also supports Attack trees the selection of an adequate modeling technique depending on user requirements. Bayesian networks ⃝c 2014 Elsevier Inc. All rights reserved. Attack and defense modeling Quantitative and qualitative security assessment Security measures Contents 1. Introduction .................................................................................................................................................................................2 2. Preliminaries ................................................................................................................................................................................4 ∗ Corresponding author at: University of Luxembourg, SnT 6, rue Coudenhove­Kalergi, 1359, Luxembourg. Tel.: +352 4666445506. E­mail addresses: [email protected] (B. Kordy), ludovic.pietre­[email protected] (L. Piètre­Cambacédès), [email protected] (P. Schweitzer). http://dx.doi.org/10.1016/j.cosrev.2014.07.001 1574­0137/⃝c 2014 Elsevier Inc. All rights reserved. 2 COMPUTERSCIENCEREVIEW ( ) ± 2.1. Keywords and terminology ................................................................................................................................................4 2.2. Examined aspects..............................................................................................................................................................5 2.3. Template of the formalism descriptions ............................................................................................................................5 3. Description of the formalisms ......................................................................................................................................................5 3.1. Static modeling of attacks..................................................................................................................................................5 3.1.1. Attack trees ..........................................................................................................................................................5 3.1.2. Augmented vulnerability trees .............................................................................................................................7 3.1.3. Augmented attack trees........................................................................................................................................7 3.1.4. OWA trees.............................................................................................................................................................8 3.1.5. Parallel model for multi­parameter attack trees ...................................................................................................8 3.1.6. Extended fault trees .............................................................................................................................................9 3.2. Sequential modeling of attacks..........................................................................................................................................9 3.2.1. Cryptographic DAGs..............................................................................................................................................9 3.2.2. Fault trees for security..........................................................................................................................................9 3.2.3. Bayesian networks for security............................................................................................................................. 10 3.2.4. Bayesian attack graphs ......................................................................................................................................... 11 3.2.5. Compromise graphs ............................................................................................................................................. 11 3.2.6. Enhanced attack trees .......................................................................................................................................... 11 3.2.7. Vulnerability cause graphs ................................................................................................................................... 12 3.2.8. Dynamic fault trees for security ........................................................................................................................... 12 3.2.9. Serial model for multi­parameter attack trees...................................................................................................... 12 3.2.10. Improved attack trees........................................................................................................................................... 13 3.2.11. Time­dependent attack trees................................................................................................................................ 13 3.3. Static modeling of attacks and defenses............................................................................................................................ 13 3.3.1. Anti­models.......................................................................................................................................................... 13 3.3.2. Defense trees........................................................................................................................................................ 14 3.3.3. Protection trees .................................................................................................................................................... 14 3.3.4. Security activity graphs ........................................................................................................................................ 15 3.3.5. Attack countermeasure trees................................................................................................................................ 15 3.3.6. Attack–defense trees ............................................................................................................................................ 15 3.3.7. Countermeasure graphs ....................................................................................................................................... 16 3.4. Sequential modeling of attacks and defenses.................................................................................................................... 16 3.4.1. Insecurity flows .................................................................................................................................................... 16 3.4.2. Intrusion DAGs ..................................................................................................................................................... 17 3.4.3. Bayesian defense graphs ...................................................................................................................................... 17 3.4.4. Security goal indicator trees ................................................................................................................................. 18 3.4.5. Attack–response trees .......................................................................................................................................... 18 3.4.6. Boolean logic driven Markov process.................................................................................................................... 18 3.4.7. Cyber security modeling language........................................................................................................................ 19 3.4.8. Security goal models ............................................................................................................................................ 19
Load more

Recommended publications
  • The Eigenfactor Metricstm: a Network Approach to Assessing Scholarly Journals
    The Eigenfactor MetricsTM: A network approach to assessing scholarly journals Jevin D. West1 Theodore C. Bergstrom2 Carl T. Bergstrom1 July 16, 2009 1Department of Biology, University of Washington, Seattle, WA 2Department of Economics, University of California, Santa Barbara, CA *The authors are the founders of the Eigenfactor Project. All of the rank- ings, algorithms, visual tools and maps of science described here are freely available at http://www.eigenfactor.org/. Correspondence can be sent to Jevin D. West at [email protected]. Keywords: EigenfactorTM Score, Article InfluenceTM Score, Impact Factor, Bibliometrics, Citation Networks 1 Abstract Limited time and budgets have created a legitimate need for quan- titative measures of scholarly work. The well-known journal impact factor is the leading measure of this sort; here we describe an alter- native approach based on the full structure of the scholarly citation network. The Eigenfactor Metrics | Eigenfactor Score and Article Influence Score | use an iterative ranking scheme similar to Google's PageRank algorithm. By this approach, citations from top journals are weighted more heavily than citations from lower-tier publications. Here we describe these metrics and the rankings that they provide. 2 1 The Need for Alternative Metrics There is only one adequate approach to evaluating the quality of an individ- ual paper: read it carefully, or talk to others who have done so. The same is largely true when it comes to evaluating any small collection of papers, such as the publications of an individual scholar. But as one moves toward assessment challenges that involve larger bodies of work across broader seg- ments of scholarship, reading individual papers becomes infeasible and a legitimate need arises for quantitative metrics for research evaluation.
    [Show full text]
  • Fumero Alfonso2017.Pdf (4.146Mb)
    This thesis has been submitted in fulfilment of the requirements for a postgraduate degree (e.g. PhD, MPhil, DClinPsychol) at the University of Edinburgh. Please note the following terms and conditions of use: This work is protected by copyright and other intellectual property rights, which are retained by the thesis author, unless otherwise stated. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This thesis cannot be reproduced or quoted extensively from without first obtaining permission in writing from the author. The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the author. When referring to this work, full bibliographic details including the author, title, awarding institution and date of the thesis must be given. Accelerating Interpreted Programming Languages on GPUs with Just-In-Time Compilation and Runtime Optimisations Juan José Fumero Alfonso I V N E R U S E I T H Y T O H F G E R D I N B U Doctor of Philosophy Institute of Computing Systems Architecture School of Informatics University of Edinburgh 2017 Abstract Nowadays, most computer systems are equipped with powerful parallel devices such as Graphics Processing Units (GPUs). They are present in almost every com- puter system including mobile devices, tablets, desktop computers and servers. These parallel systems have unlocked the possibility for many scientists and companies to process significant amounts of data in shorter time. But the usage of these parallel systems is very challenging due to their programming complexity.
    [Show full text]
  • Journal Influence Factors
    Journal influence factors✩ Massimo Franceschet Department of Mathematics and Computer Science, University of Udine Via delle Scienze 206 – 33100 Udine, Italy Phone: +39 0432 558754 / Fax: +39 0432 558499 [email protected] Abstract We performed a thorough comparison of four main indicators of journal influence, namely 2- year impact factor, 5-year impact factor, eigenfactor and article influence. These indicators have been recently added by Thomson Reuters to the Journal Citation Reports, in both science and social science editions, and are thus available for study and comparison over a sample of significative size. We find that the distribution associated with the eigenfactor largely differs from the distribution of the other surveyed measures in terms of deviation from the mean, concentration, entropy, and skewness. Moreover, it is the one that best fits to the lognormal theoretical model. Surprisingly, the eigenfactor is also the most variable indicator when computed across different fields of science and social science, while article influence is the most stable in this respect, and hence the most suitable metric to be used interdisciplinarily. Finally, the journal rankings provided by impact factors and article influence are relatively similar and diverge from the one produced by eigenfactor, which is closer to that given by the total number of received citations. Keywords: Journal influence measures, Impact factor, Eigenfactor metrics, Cross-field variability. 1. Introduction The impact factor is, undoubtedly, the most popular and controversial bibliometric in- dicator available at the moment. It is defined, for a given journal, as the mean number of citations in a given census year to papers published in the journal during a target window consisting of the two previous years.
    [Show full text]
  • Laurie A. Williams
    LAURIE A. WILLIAMS Email: [email protected] http://www.csc.ncsu.edu/faculty/williams Office: (919) 513-4151 RESEARCH AREAS Software Engineering: Software Security, Agile Software Development Processes and Practices, Continuous Deployment/DevOps, sEmpirical Software Engineering, Software Reliability, Software Testing, Pair-Programming EDUCATION Ph.D. Computer Science Computer Science, University of Utah Spring 2000 Dissertation Title: The Collaborative Software ProcessSM Advisor: Robert R. Kessler M.B.A. Fuqua School of Business, Duke University 1990 B.S. Industrial Engineering Industrial Engineering, Lehigh University 1984 AWARDS AND HONOR SOCIETIES IEEE Fellow, 2018 Carol Miller Graduate Lecturer Award, 2016-2017 NCSU Research Leadership Academy, 2016 2014-2015 Alumni Association Outstanding Research Award North Carolina State University Faculty Scholar, 2014 ACM Distinguished Scientist, 2011 IBM Smarter Planet Faculty Award 2010 ACM SIGSOFT Influential Educator Award, 2009 North Carolina State Chapter of Sigma Xi, 2007 ACM/AITP Student Chapter Award: Most Helpful Professor Outside of Class, 2007 Member, NC State's Academy of Outstanding Teachers, 2006 National Science Foundation CAREER Award, 2003 IBM University Partnership/Faculty Award, 2003, 2005, 2008, 2009, 2010 IBM JaZZ Innovation Award, 2008 IBM Eclipse Innovation Award, 2002 Tau Beta Pi Engineering Honor Society Alpha Pi Mu Industrial Engineering Honor Society Phi Eta Sigma Freshman Honor Society RESEARCH EXPERIENCE Distinguished Professor, Computer Science, North Carolina
    [Show full text]
  • Search Based Software Engineering for Software Product Line Engineering: a Survey and Directions for Future Work
    Search based software engineering for software product line engineering: a survey and directions for future work M. Harman, Y. Jia, J. Krinke, W. B. Langdon, J. Petke & Y. Zhang CREST Centre, University College London, Malet Place, London, WC1E 6BT, U.K. ABSTRACT A well managed SPL benefits from the commonalities This paper1 presents a survey of work on Search Based shared by all features. It allows us to address many of the Software Engineering (SBSE) for Software Product Lines goals that have long been sought in software engineering, (SPLs). We have attempted to be comprehensive, in the such as reuse, traceability of requirements into products, sense that we have sought to include all papers that ap- systematic testing and the control of software maintenance ply computational search techniques to problems in software and evolutionary processes. product line engineering. Having surveyed the recent explo- It is natural to think of many of the problems in software sion in SBSE for SPL research activity, we highlight some di- product line engineering as problems of optimisation. The rections for future work. We focus on suggestions for the de- wide variability of different products expressed by their fea- velopment of recent advances in genetic improvement, show- ture models, creates a large and rich search space in which ing how these might be exploited by SPL researchers and we can seek optimal (or near optimal) choices of products. practitioners: Genetic improvement may grow new prod- Many of the problems in SPL engineering involve balances ucts with new functional and non-functional features and of multiple competing and conflicting software engineering graft these into SPLs.
    [Show full text]
  • Eigenfactor: Ranking and Mapping Scientific Knowledge
    Eigenfactor: ranking and mapping scientific knowledge Jevin D. West A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Washington 2010 Program Authorized to Offer Degree: Department of Biology University of Washington Graduate School This is to certify that I have examined this copy of a doctoral dissertation by Jevin D. West and have found that it is complete and satisfactory in all respects, and that any and all revisions required by the final examining committee have been made. Chair of the Supervisory Committee: Carl T. Bergstrom Reading Committee: Carl T. Bergstrom Benjamin B. Kerr Thomas L. Daniel Date: c Copyright 2010 Jevin D. West In presenting this dissertation in partial fulfillment of the requirements for the doctoral degree at the University of Washington, I agree that the Library shall make its copies freely available for inspection. I further agree that extensive copying of the dissertation is allowable only for scholarly purposes, consistent with fair use as prescribed in the U.S. Copyright Law. Requests for copying or reproduction of this dissertation may be referred to ProQuest Information and Learning, 300 North Zeeb Road, Ann Arbor, MI 48106- 1346, 1-800-521-0600, to whom the author has granted the right to reproduce and sell (a) copies of the manuscript in microform and/or (b) printed copies of the manuscript made from microform. Signature Date University of Washington Abstract Eigenfactor: ranking and mapping the scholarly literature Jevin D. West Chair of the Supervisory Committee: Professor Carl T. Bergstrom Department of Biology Each year, tens of thousands of scholarly journals publish hundreds of thou- sands of scholarly papers, collectively containing tens of millions of citations.
    [Show full text]
  • The Content of Sci-Hub and Its Usage[Version 1; Peer Review: 2
    F1000Research 2017, 6:541 Last updated: 27 SEP 2021 RESEARCH ARTICLE Looking into Pandora's Box: The Content of Sci-Hub and its Usage [version 1; peer review: 2 approved, 2 approved with reservations] Bastian Greshake Institute of Cell Biology and Neuroscience, Goethe University Frankfurt, Frankfurt, Germany v1 First published: 21 Apr 2017, 6:541 Open Peer Review https://doi.org/10.12688/f1000research.11366.1 Latest published: 21 Apr 2017, 6:541 https://doi.org/10.12688/f1000research.11366.1 Reviewer Status Invited Reviewers Abstract Despite the growth of Open Access, potentially illegally circumventing 1 2 3 4 paywalls to access scholarly publications is becoming a more mainstream phenomenon. The web service Sci-Hub is amongst the version 1 biggest facilitators of this, offering free access to around 62 million 21 Apr 2017 report report report report publications. So far it is not well studied how and why its users are accessing publications through Sci-Hub. By utilizing the recently 1. April Hathcock, New York University , New released corpus of Sci-Hub and comparing it to the data of ~28 million downloads done through the service, this study tries to address some York, USA of these questions. The comparative analysis shows that both the 2. Gabriel Gardner , California State usage and complete corpus is largely made up of recently published articles, with users disproportionately favoring newer articles and 35% University, Long Beach, USA of downloaded articles being published after 2013. These results hint Stephen McLaughlin, University of Texas at that embargo periods before publications become Open Access are frequently circumnavigated using Guerilla Open Access approaches Austin, Austin, USA like Sci-Hub.
    [Show full text]
  • DAG-Based Attack and Defense Modeling Approaches Published Before 2013
    DAG-Based Attack and Defense Modeling: Don’t Miss the Forest for the Attack Trees.∗ Barbara Kordy1, Ludovic Piètre-Cambacédès2, Patrick Schweitzer1 1University of Luxembourg, 2EDF, France Abstract This paper presents the current state of the art on attack and defense modeling approaches that are based on directed acyclic graphs (DAGs). DAGs allow for a hierarchical decomposi- tion of complex scenarios into simple, easily understandable and quantifiable actions. Methods based on threat trees and Bayesian networks are two well-known approaches to security mod- eling. However there exist more than 30 DAG-based methodologies, each having different features and goals. The objective of this survey is to present a complete overview of graphical attack and defense modeling techniques based on DAGs. This consists of summarizing the existing methodologies, comparing their features and proposing a taxonomy of the described formalisms. This article also supports the selection of an adequate modeling technique de- pending on user requirements. 1 Introduction Graphical security models provide a useful method to represent and analyze security scenarios that examine vulnerabilities of systems and organizations. The great advantage of graph-based approaches lies in combining user friendly, intuitive, visual features with formal semantics and algorithms that allow for qualitative and quantitative analysis. Over the course of the last two decades, graphical approaches attracted the attention of numerous security and formal methods experts and are quickly becoming a stand-alone research area with dedicated national and inter- national research projects [14, 17, 241, 263, 273]. Graphical models constitute a valuable support tool to facilitate threat assessment and risk management of real-life systems.
    [Show full text]
  • How to Get Your Research Published… …And Then Noticed
    How to get your research published… …and then noticed. elsevier.com/authors Contents Introduction . 1 Getting published . 2 Getting noticed . 23 Tracking your impact . 27 Why publish with Elsevier? . 29 Useful links . 31 December 2020 Copyright © 2020 Elsevier . All rights reserved How to get your research published and then noticed Introduction As a researcher, you make huge strides in advancing essential knowledge . Your achievements can save lives, change the way we understand the world and improve our quality of life . When you’re ready to share your knowledge, the best way to do it is by publishing your work . In this booklet, you’ll find simple, Then it’s time to get your work actionable support that will help you noticed… publish and promote your research and With your peer-reviewed article make the biggest impact you can with published and available online, there’s your work . a lot you can do to promote your work In the first section, we’ll look atgetting and get it out to a wider audience . published . ● Sharing your article The decisions you make about your ● Increasing your visibility publications affect their ultimate impact: ● Writing a lay summary the journal you choose, the type of ● The power of social media article and the way you write about your ● Media coverage research all contribute to the result . ● When and what to publish … And finally, track your impact . ● How to write a great research paper This won’t be the only paper you’ll ● Choosing the best journal for your publish, so it’s useful to build an work understanding of what works well and where you could make improvements .
    [Show full text]
  • Kopernio Locker Which Is Stored in the Cloud, (Like a Dropbox Folder)
    Kopernio Fast, one-click access to millions of research papers Bob Green Solution Specialist March 2019 Full Text Access 83% of college students begin their searches using search 83% engines outside the library website.1 Sci-Hub provides up to 600,000 downloads per day to users 600,000 around the globe.2 75% of Sci-Hub downloads at the University of Utrecht in the Netherlands would have been available either through 75% library subscriptions, Open Access or free on publisher websites.3 1De Rosa, C., Cantrell, J. Carlson, M., et al. (2011). Perceptions of Libraries, 2010: Context and Community. Dublin, Ohio: OCLC. Link. 2Himmelstein, D. S., Romero, A. R., Levernier, J. G., et al. (2018). Sci-Hub provides access to nearly all scholarly literature. Elife, 7, 22. doi:10.7554/eLife.32822 3Kramer, B. (June 20, 2016). Sci-Hub: access or convenience? A Utrecht case study (part 2). Link. 2 28 Million SciHub Downloads between September 2015-February 2016 “some of the most intense use of Sci-Hub appears to be happening on the campuses of U.S. and European universities.” Bohannon, J. (2016). Who's downloading pirated papers? Everyone. Science, 352(6285), 508-512. doi:10.1126/science.352.6285.508 Link 3 Desired path 4 Desired path to Full Text Go to library website Click “access” Log in via proxy button Navigate to the article again…if Find the available. (If not, request via ILL). journal Encounter article paywall on open web #icanhazpdf 5 Desired path to Full Text Kopernio Goals Provide researchers with access to full text that integrates “Access to sources, not the into their existing workflows– make access part of discovery of sources, is the discovery, as opposed to a separate task.
    [Show full text]
  • An Internet Measure of the Value of Citations Boleslaw K
    1 Information Sciences, Elsevier, 185(1) February 2012, pp. 18-31 An Internet Measure of the Value of Citations Boleslaw K. Szymanskia, Josep Lluis de la Rosaab and Mukkai Krishnamoorthya a Network Science and Technology (NeST) Center - Rensselaer Polytechnic Institute 118, 8th Street, Troy, New York (USA) b EASY Innovation TECNIO Center @ University of Girona, Campus de Montilivi, E17071 Girona, Catalonia (EU) ABSTRACT A new method for computing the value of citations is introduced and compared with the PageRank algorithm for author ranking. In our proposed approach, the value of each publication is expressed in CENTs (sCientific currENcy Tokens). The publication’s value is then divided by the number of citations made by that publication to yield a value for each citation. As citations are the acknowledgements of the work by authors other than oneself (indicating that it has been useful), selfcitations count as zero in acknowledged citation value. Circular citations, a generalized type of selfcitation, are considered to have a reduced acknowledged citation value. Finally, we propose a modification of the hindex to define it as the largest integer such that the i-th publication (on the list of publications sorted by their value in CENTs) is worth more than i CENTs. This new index, termed the iindex or i2 in short, appears to be a more precise measure of the impact of publications and their authors’ productivity than the hindex. 1. Introduction Currently, the impact of a scientific publication is often measured by the number of citations it receives. Perhaps we are suffering from an over-analysis of citations for the purposes of assessing scientists and universities productivity, impact, or prestige—the examination of citations of scientific publications has become a cottage industry in higher education.
    [Show full text]
  • Universidade Federal Da Bahia Abimael Magno Do
    1 UNIVERSIDADE FEDERAL DA BAHIA ESCOLA DE ADMINISTRAÇÃO NÚCLEO DE PÓS-GRADUAÇÃO EM ADMINISTRAÇÃO – NPGA ABIMAEL MAGNO DO OURO FILHO RELAÇÃO ENTRE APRENDIZAGEM INTERORGANIZACIONAL E DESEMPENHO: UM ESTUDO EM UMA REDE DO TIPO ARRANJO PRODUTIVO LOCAL (APL). Salvador 2019 2 ABIMAEL MAGNO DO OURO FILHO RELAÇÃO ENTRE APRENDIZAGEM INTERORGANIZACIONAL E DESEMPENHO: UM ESTUDO EM UMA REDE DO TIPO ARRANJO PRODUTIVO LOCAL (APL). Tese doutoral apresentada ao Núcleo de Pós-Graduação em Administração – NPGA da Escola de Administração da Universidade Federal da Bahia, como requisito parcial para a obtenção do grau de Doutor em Administração. Orientadora: Prof.ª Dr.ª Maria Elena Leon Olave Salvador 2019 3 Escola de Administração - UFBA O93 Ouro Filho, Abimael Magno do. Relação entre aprendizagem interorganizacional e desempenho: um estudo em uma rede do tipo Arranjo Produtivo Local (APL) / Abimael Magno do Ouro Filho. – 2019. 199 f. Orientadora: Profa. Dra. Maria Elena Leon Olave. Tese (doutorado) – Universidade Federal da Bahia, Escola de Administração, Salvador, 2019. 1. Relações interorganizacionais – Estudo e ensino. 2. Pequenas e medias empresas – Registro de desempenho - Avaliação - Santa Cruz do Capibaribe (PE). 3. Aprendizagem organizacional. 4. Cooperação. I. Universidade Federal da Bahia. Escola de Administração. II. Título. CDD – 658.406 4 ABIMAEL MAGNO DO OURO FILHO RELAÇÃO ENTRE APRENDIZAGEM INTERORGANIZACIONAL E DESEMPENHO: UM ESTUDO EM UMA REDE DO TIPO ARRANJO PRODUTIVO LOCAL (APL). Tese de doutorado apresentada como requisito para obtenção
    [Show full text]