VGTU talpykla >
Fundamentinių mokslų fakultetas / Faculty of Fundamental Sciences >
Moksliniai straipsniai / Research articles >
Please use this identifier to cite or link to this item:
http://dspace.vgtu.lt/handle/1/3881
|
Title: | Defining the Minimum Security Baseline in a Multiple Security Standards Environment by Graph Theory Techniques |
Authors: | Olifer, Dmitrij Goranin, Nikolaj Čenys, Antanas Kačeniauskas, Arnas Janulevičius, Justinas |
Keywords: | information security standard graph theory vertex cover algorithm graph isomorphism minimums security baseline standard mapping |
Issue Date: | 2019 |
Publisher: | MDPI |
Citation: | Olifer, D.; Goranin, N.; Cenys, A.; Kaceniauskas, A.; Janulevicius, J. Defining the Minimum Security Baseline in a Multiple Security Standards Environment by Graph Theory Techniques. Appl. Sci. 2019, 9, 681. |
Series/Report no.: | 9;4 |
Abstract: | One of the best ways to protect an organization’s assets is to implement security requirements defined by different standards or best practices. However, such an approach is complicated and requires specific skills and knowledge. In case an organization applies multiple security standards, several problems can arise related to overlapping or conflicting security requirements, increased expenses on security requirement implementation, and convenience of security requirement monitoring. To solve these issues, we propose using graph theory techniques. Graphs allow the presentation of security requirements of a standard as graph vertexes and edges between vertexes, and would show the relations between different requirements. A vertex cover algorithm is proposed for minimum security requirement identification, while graph isomorphism is proposed for comparing existing organization controls against a set of minimum requirements identified in the previous step. |
URI: | http://dspace.vgtu.lt/handle/1/3881 |
ISSN: | 2076-3417 |
Appears in Collections: | Moksliniai straipsniai / Research articles
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|