2 research outputs found

    An Automated, End-to-End Framework for Modeling Attacks From Vulnerability Descriptions

    Full text link
    Attack graphs are one of the main techniques used to automate the risk assessment process. In order to derive a relevant attack graph, up-to-date information on known attack techniques should be represented as interaction rules. Designing and creating new interaction rules is not a trivial task and currently performed manually by security experts. However, since the number of new security vulnerabilities and attack techniques continuously and rapidly grows, there is a need to frequently update the rule set of attack graph tools with new attack techniques to ensure that the set of interaction rules is always up-to-date. We present a novel, end-to-end, automated framework for modeling new attack techniques from textual description of a security vulnerability. Given a description of a security vulnerability, the proposed framework first extracts the relevant attack entities required to model the attack, completes missing information on the vulnerability, and derives a new interaction rule that models the attack; this new rule is integrated within MulVAL attack graph tool. The proposed framework implements a novel pipeline that includes a dedicated cybersecurity linguistic model trained on the the NVD repository, a recurrent neural network model used for attack entity extraction, a logistic regression model used for completing the missing information, and a novel machine learning-based approach for automatically modeling the attacks as MulVAL's interaction rule. We evaluated the performance of each of the individual algorithms, as well as the complete framework and demonstrated its effectiveness.Comment: 16 pages, 11 figure

    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE Β«CORPUS LINGUISTICS–2019Β», June 24–28, 2019, St. Petersburg

    Get PDF
    Π‘Π±ΠΎΡ€Π½ΠΈΠΊ содСрТит ΠΌΠ°Ρ‚Π΅Ρ€ΠΈΠ°Π»Ρ‹ Π΄ΠΎΠΊΠ»Π°Π΄ΠΎΠ², прСдставлСнных Π½Π° ΠœΠ΅ΠΆΠ΄ΡƒΠ½Π°Ρ€ΠΎΠ΄Π½ΠΎΠΉ Π½Π°ΡƒΡ‡Π½ΠΎΠΉ ΠΊΠΎΠ½Ρ„Π΅Ρ€Π΅Π½Ρ†ΠΈΠΈ Β«ΠšΠΎΡ€ΠΏΡƒΡΠ½Π°Ρ лингвистика-2019Β» 24–28 июня 2019 Π³. Π² Π‘Π°Π½ΠΊΡ‚-ΠŸΠ΅Ρ‚Π΅Ρ€Π±ΡƒΡ€Π³Π΅. Π‘ΠΎΠ·Π΄Π°Π½ΠΈΠ΅ корпусов тСкстов являСтся ΠΎΠ΄Π½ΠΈΠΌ ΠΈΠ· ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π½Ρ‹Ρ… Π½Π°ΠΏΡ€Π°Π²Π»Π΅Π½ΠΈΠΉ Π² соврСмСнной лингвистикС. ΠŸΡ€ΠΎΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ ΠΊΠΎΠ½Ρ„Π΅Ρ€Π΅Π½Ρ†ΠΈΠΈ ΠΏΠΎ Π΄Π°Π½Π½ΠΎΠΉ Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ΅ Π·Π½Π°ΠΊΠΎΠΌΠΈΡ‚ ΡƒΡ‡Π΅Π½Ρ‹Ρ… с соврСмСнными Ρ€Π°Π·Ρ€Π°Π±ΠΎΡ‚ΠΊΠ°ΠΌΠΈ ΠΈ Π½ΠΎΠ²Ρ‹ΠΌΠΈ тСхнологичСскими Ρ€Π΅ΡˆΠ΅Π½ΠΈΡΠΌΠΈ Π² этой области, Π° Ρ‚Π°ΠΊΠΆΠ΅ способствуСт ΠΎΠ±ΠΎΠ±Ρ‰Π΅Π½ΠΈΡŽ ΠΎΠΏΡ‹Ρ‚Π° Π½Π°ΡƒΡ‡Π½Ρ‹Ρ… исслСдований ΠΏΠΎ корпусной лингвистикС
    corecore