Abstract

Big Data platforms store vast amounts of information, necessitating robust security measures, including risk-based approaches. Risk assessment, a key part of Information Security Management Systems (ISMS), involves evaluating threats, vulnerabilities, and documenting risks through risk registers. Organizations face the challenge of allocating resources effectively to implement controls that mitigate these risks. This involves calculating risk scores before and after control implementation and prioritizing them—an NP-Complete (Nondeterministic Polynomial-time Complete) problem. This paper presents a mathematical model for solving this using the Z3 Satisfiability Modulo Theories (SMT) solver. The model enables risk-based planning for security implementation in big data platforms. The results demonstrate the feasibility of the approach, with the system processing up to 11 risks (almost 40 million permutations) efficiently, compared to brute force methods, which struggle beyond six risks (720 permutations).

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.